The Experts below are selected from a list of 2865 Experts worldwide ranked by ideXlab platform
D. Zinoviev - One of the best experts on this subject based on the ideXlab platform.
-
Low-Correlation, High-Nonlinearity Sequences for Multiple-Code CDMA
IEEE Transactions on Information Theory, 2006Co-Authors: P. Sole, D. ZinovievAbstract:Families of binary low-correlation sequences with high nonlinearity (in relation with their Walsh Hadamard transform) are constructed by using the most significant bit of linear recurrence sequences over the ring Zopf2 l, for lges3. The engineering motivation is the design of a multiple-code code-division multiple-access (CDMA) scheme with a control of low peak-to-average power ratio (PAPR). Proof techniques combine Galois ring theory (local Weil bound) with spectral analysis over the additive group of Zopf2 l. New estimates on the size of weighted degree trace codes are derived. The parameters of the sequences families constructed are shown to lie above a modified Varshamov-Gilbert bound
-
the most significant bit of maximum length sequences over spl zopf 2 sup l autocorrelation and imbalance
IEEE Transactions on Information Theory, 2004Co-Authors: Patrick Sole, D. ZinovievAbstract:The imbalance and the autocorrelation of the binary sequences in the title are explored by combining the local Weil bound with spectral analysis. Recent estimates on these quantities are improved by a factor of order 2/sup l/2/, for large l.
-
The most significant bit of maximum-length sequences over /spl Zopf/2/sup l/: autocorrelation and imbalance
IEEE Transactions on Information Theory, 2004Co-Authors: P. Sole, D. ZinovievAbstract:The imbalance and the autocorrelation of the binary sequences in the title are explored by combining the local Weil bound with spectral analysis. Recent estimates on these quantities are improved by a factor of order 2/sup l/2/, for large l.
Patrick Sole - One of the best experts on this subject based on the ideXlab platform.
-
the peak to sidelobe level of the most significant bit of trace codes over galois rings
SETA '08 Proceedings of the 5th international conference on Sequences and Their Applications, 2008Co-Authors: Patrick Sole, Dimitrii ZinovievAbstract:Weighted degree trace codes over even characteristic Galois rings give binary sequences by projection on their most significant bit (MSB). Upper bounds on the aperiodic correlation, peak to sidelobe level (PSL), partial period imbalance and partial period pattern imbalance of these sequences are derived. The proof technique involves estimates of incomplete character sums over Galois rings, combining Weil-like bounds with Fourier transform estimates.
-
SETA - The Peak to Sidelobe Level of the most significant bit of Trace Codes over Galois Rings
Sequences and Their Applications - SETA 2008, 2008Co-Authors: Patrick Sole, Dimitrii ZinovievAbstract:Weighted degree trace codes over even characteristic Galois rings give binary sequences by projection on their most significant bit (MSB). Upper bounds on the aperiodic correlation, peak to sidelobe level (PSL), partial period imbalance and partial period pattern imbalance of these sequences are derived. The proof technique involves estimates of incomplete character sums over Galois rings, combining Weil-like bounds with Fourier transform estimates.
-
distribution of r patterns in the most significant bit of a maximum length sequence over z2
Lecture Notes in Computer Science, 2005Co-Authors: Patrick Sole, Dmitrii ZinovievAbstract:The number of subwords of length r and of given value within a period of a sequence in the title is shown to be close to equidistribution. Important tools in the proof are a higher order correlation and Galois ring character sum estimates.
-
distribution of r patterns in the most significant bit of a maximum length sequence over z 2 l
SETA'04 Proceedings of the Third international conference on Sequences and Their Applications, 2004Co-Authors: Patrick Sole, Dmitrii ZinovievAbstract:The number of subwords of length r and of given value within a period of a sequence in the title is shown to be close to equidistribution. Important tools in the proof are a higher order correlation and Galois ring character sum estimates.
-
the most significant bit of maximum length sequences over spl zopf 2 sup l autocorrelation and imbalance
IEEE Transactions on Information Theory, 2004Co-Authors: Patrick Sole, D. ZinovievAbstract:The imbalance and the autocorrelation of the binary sequences in the title are explored by combining the local Weil bound with spectral analysis. Recent estimates on these quantities are improved by a factor of order 2/sup l/2/, for large l.
P. Sole - One of the best experts on this subject based on the ideXlab platform.
-
Low-Correlation, High-Nonlinearity Sequences for Multiple-Code CDMA
IEEE Transactions on Information Theory, 2006Co-Authors: P. Sole, D. ZinovievAbstract:Families of binary low-correlation sequences with high nonlinearity (in relation with their Walsh Hadamard transform) are constructed by using the most significant bit of linear recurrence sequences over the ring Zopf2 l, for lges3. The engineering motivation is the design of a multiple-code code-division multiple-access (CDMA) scheme with a control of low peak-to-average power ratio (PAPR). Proof techniques combine Galois ring theory (local Weil bound) with spectral analysis over the additive group of Zopf2 l. New estimates on the size of weighted degree trace codes are derived. The parameters of the sequences families constructed are shown to lie above a modified Varshamov-Gilbert bound
-
The most significant bit of maximum-length sequences over /spl Zopf/2/sup l/: autocorrelation and imbalance
IEEE Transactions on Information Theory, 2004Co-Authors: P. Sole, D. ZinovievAbstract:The imbalance and the autocorrelation of the binary sequences in the title are explored by combining the local Weil bound with spectral analysis. Recent estimates on these quantities are improved by a factor of order 2/sup l/2/, for large l.
R.f. Woods - One of the best experts on this subject based on the ideXlab platform.
-
A high performance IIR filter chip and its evaluation system
Proceedings of IEEE International Conference on Application Specific Array Processors (ASSAP'94), 1994Co-Authors: R.l. Walke, R.a. Evans, R.f. Woods, G. Floyd, K.w. WoodAbstract:A highly flexible programmable IIR filter chip has been designed and fabricated to commercial requirements within a collaborative project involving several industrial partners. The device uses 8 highly regular 16 bit array multiplier-accumulators which have been pipelined to achieve an overall computational rate of 30 MHz using a 1 micron gate array process. most significant bit first arithmetic has been employed to achieve the target 15 MHz sample rate whilst implementing an 8th order filter. The paper reviews the principles behind the filter chip and its architecture, and describes a modular system which has been built to facilitate its demonstration and evaluation.
-
Pipelined two-port adaptor for wave digital filtering
International Conference on Acoustics Speech and Signal Processing, 1990Co-Authors: R.j. Singh, J.v. Mccanny, R.f. WoodsAbstract:The application of fine grain pipelining techniques in the design of high performance wave digital filters (WDFs) is described. The problems of latency in feedback loops can be significantly reduced if computations are organized most significant, as opposed to least significant, bit first and if the results are fed back as soon as they are formed. The result is that chips can be designed which offer significantly higher sampling rates than otherwise can be obtained using conventional methods. How these concepts can be extended to the more challenging problem of WDFs is discussed. It is shown that significant increases in the sampling rate of bit-parallel circuits can be achieved using most significant bit first arithmetic.
Dimitrii Zinoviev - One of the best experts on this subject based on the ideXlab platform.
-
the peak to sidelobe level of the most significant bit of trace codes over galois rings
SETA '08 Proceedings of the 5th international conference on Sequences and Their Applications, 2008Co-Authors: Patrick Sole, Dimitrii ZinovievAbstract:Weighted degree trace codes over even characteristic Galois rings give binary sequences by projection on their most significant bit (MSB). Upper bounds on the aperiodic correlation, peak to sidelobe level (PSL), partial period imbalance and partial period pattern imbalance of these sequences are derived. The proof technique involves estimates of incomplete character sums over Galois rings, combining Weil-like bounds with Fourier transform estimates.
-
SETA - The Peak to Sidelobe Level of the most significant bit of Trace Codes over Galois Rings
Sequences and Their Applications - SETA 2008, 2008Co-Authors: Patrick Sole, Dimitrii ZinovievAbstract:Weighted degree trace codes over even characteristic Galois rings give binary sequences by projection on their most significant bit (MSB). Upper bounds on the aperiodic correlation, peak to sidelobe level (PSL), partial period imbalance and partial period pattern imbalance of these sequences are derived. The proof technique involves estimates of incomplete character sums over Galois rings, combining Weil-like bounds with Fourier transform estimates.