The symmetric rudin-shapiro transform - an easy, stable, and fast construction of multiple orthogonal spread spectrum signals

Cour-Harbo, Anders la

doi:10.1109/ispa.2003.1296905

Cited by 2 publications

(4 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This method uses a preamble that consists of two identical segments, each with L= N / 2 samples. The used sequence has low Peak to Average Power Ratio (PAPR) and it could be a PN sequence or a CAZAC sequence, [9], which can be expressed by, A constant envelope preamble is generated by applying the Discrete Fourier Transform (DFT) to a CAZAC sequence [16] of a length N and the symmetry in the time domain, satisfying the following condition. To improve the estimation performance at the receiver, each sample of the sequence is multiplied by a PN sequence.…”

Section: A Long Preamblementioning

confidence: 99%

“…One interesting characteristic of a GRS sequence is that a uniform upper bound for the PAPR, which is independent of the length sequence [10][11][12][13][14][15][16], is considered as a flat polynomial having the properties of a spread spectrum sequence [16]. Additionally this polynomial is orthogonal and its amplitude is on the unit circle [10][11][12][13][14][15][16].…”

Section: B Short Preamblementioning

confidence: 99%

“…Additionally this polynomial is orthogonal and its amplitude is on the unit circle [10][11][12][13][14][15][16].…”

Section: B Short Preamblementioning

confidence: 99%

See 2 more Smart Citations

Synchronization algorithms based on weighted CAZAC preambles for OFDM systems

Silva

Harris

Dolecek

2013

2013 13th International Symposium on Communications and Information Technologies (ISCIT)

View full text Add to dashboard Cite

In this paper, we study the performances of preambles with a weighted structure for estimate the Timing Offset and Frequency Offset in Orthogonal Frequency Division Multiplexing (OFDM) systems. We have reviewed the configuration in short and long preambles of weighted preambles, based on Constant Amplitude Zero Auto Correlation (CAZAC) sequences weighted by a Pseudo Noise (PN) sequences. In this paper we have designed short and long preambles with a CAZAC sequence weighted by a Golay Rudin Shapiro sequence and their respective timing metrics. By simulation in MATLAB, we get the Mean Square Error (MSE) of the estimation, the Bit Error Rate (BER) of transmitted data over Rayleigh fading channel with Additive White Gaussian Noise (AWGN), coarse timing and frequency offset.

show abstract

Section: A Long Preamblementioning

confidence: 99%

Section: B Short Preamblementioning

confidence: 99%

See 1 more Smart Citation

Synchronization algorithms based on weighted CAZAC preambles for OFDM systems

Silva

Harris

Dolecek

2013

2013 13th International Symposium on Communications and Information Technologies (ISCIT)

View full text Add to dashboard Cite

show abstract

“…By doing this it is possible to avoid the computational demanding powers of (−1) in (15). For more details, see [24].…”

Section: Fast Implementationmentioning

confidence: 99%

On the Rudin–Shapiro transform

Cour-Harbo

2008

Applied and Computational Harmonic Analysis

Self Cite

View full text Add to dashboard Cite

The Rudin-Shapiro transform (RST) is a linear transform derived from the remarkable Rudin-Shapiro polynomials discovered in 1951. The transform has the notable property of forming a spread spectrum basis for R N , i.e. the basis vectors are sequences with a nearly flat power spectrum. It is also orthogonal and Hadamard, and it can be made symmetric. This presentation is partly a tutorial on the RST, partly some new results on the symmetric RST that makes the transform interesting from an applicational point-of-view. In particular, it is shown how to make a very simple O(N log N) implementation, which is quite similar to the Haar wavelet packet transform.The Rudin-Shapiro transform was originally conceived as a series of coefficient sequences from a set of trigonometric polynomials discovered by Shapiro and Rudin in the 1950s. Since then the transform has come to exist in its own right. This is because the transform has a series of nice properties among which the spread spectrum property of the basis elements is the most noticeable one. The transform proves useful for designing signals in low-cost hardware, not least due to the existence of a fast and numerically robust implementation.The Rudin-Shapiro polynomials are categorized as flat polynomials. This refers to the fact that the amplitude of the complex polynomials are, on the unit circle, bounded by a constant times the energy of the polynomial. There exists many other examples of flat polynomials besides the Rudin-Shapiro polynomials, and the history of the development in the field of flat polynomials is quite interesting. This is in no small part due to the fact that a number of seemingly simple questions within the field have remained unanswered for several decades.Flat polynomials are also interesting for applications. The author has demonstrated, see la Cour-Harbo [23], that a spread spectrum transform has a role to play in the attempt to increase the robustness of active sensors. In that context the aim of this presentation is to show the mathematical background for properties exploited in real applications.The paper is divided into four parts (sections). Section 1 reviews some of the important definitions and notions in the field of flat polynomials. This is followed by a short historical background listing some of the major contributions in this field. In Section 2 the classical Rudin-Shapiro polynomials are presented along with some previously known results on the crest factor and auto and cross correlation properties of RS polynomials.

show abstract

The symmetric rudin-shapiro transform - an easy, stable, and fast construction of multiple orthogonal spread spectrum signals

Cited by 2 publications

References 6 publications

Synchronization algorithms based on weighted CAZAC preambles for OFDM systems

Synchronization algorithms based on weighted CAZAC preambles for OFDM systems

On the Rudin–Shapiro transform

Contact Info

Product

Resources

About