Efficient computation of DFT of Zadoff-Chu sequences

Beyme, Steffen; Leung, Cyril

doi:10.1049/el.2009.3330

Cited by 78 publications

(46 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We have introduced the notationč k = [36][37][38], used in modern cellular mobile communication systems for their favorable autocorrelation properties. They are preserved under the DFT up to a prefactor and taking the complex conjugate.…”

Section: Braiding Operatorsmentioning

confidence: 99%

Quantum computing with parafermions

Hutter

Loss

2016

Phys. Rev. B

View full text Add to dashboard Cite

Z d parafermions are exotic non-Abelian quasiparticles generalizing Majorana fermions, which correspond to the case d = 2. In contrast to Majorana fermions, braiding of parafermions with d > 2 allows one to perform an entangling gate. This has spurred interest in parafermions, and a variety of condensed matter systems have been proposed as potential hosts for them. In this work, we study the computational power of braiding parafermions more systematically. We make no assumptions on the underlying physical model but derive all our results from the algebraical relations that define parafermions. We find a family of 2d representations of the braid group that are compatible with these relations. The braiding operators derived this way reproduce those derived previously from physical grounds as special cases. We show that if a d-level qudit is encoded in the fusion space of four parafermions, braiding of these four parafermions allows one to generate the entire single-qudit Clifford group (up to phases), for any d. If d is odd, then we show that in fact the entire many-qudit Clifford group can be generated.

show abstract

Section: Braiding Operatorsmentioning

confidence: 99%

Quantum computing with parafermions

Hutter

Loss

2016

Phys. Rev. B

View full text Add to dashboard Cite

show abstract

“…Considering the special properties of ZC sequences, an attempt to reduce the computation complexity of ZC sequences' DFT has been done in [8]. The DFT of the u th root ZC sequence x u (n) of prime length N ZC is equal to a conjugated and time-scaled version of x u (n), up to a constant factor:…”

Section: Previous Dft Of Preamble Sequencesmentioning

confidence: 99%

“…Then the efficient discrete fourier transform structures more suitable for applications of ZC sequences have been derived [8]. Nevertheless, the discrete fourier transform structures in [8] cannot always be used to reduce the number of operations in the transmitter of long term evolution user equipment, as the transmitted random access (RA) preamble can be a cyclically shifted version of the basic ZC sequences. In addition, this discrete fourier transform structures cannot avoid large storage and complex computation of complex exponential function.…”

Section: Introductionmentioning

confidence: 99%

Random Access Preamble Generation with Low Storage for LTE Networks

Xin

et al. 2017

ITM Web Conf.

View full text Add to dashboard Cite

Abstract. Long Term Evolution (LTE) random access preambles are generated from cyclically shifted Zadoff-Chu(ZC) sequences of prime length by using so-called Discrete Fourier Transformation-Spread-Orthogonal Frequency Division Multiplexing (DFT-S-OFDM) modulation. In this paper we propose a novel preamble generation to reduce the storage and complexity of cyclically shifted ZC sequences' Discrete Fourier Transformation (DFT). The proposed preamble generation allows the DFT of cyclically shifted ZC sequences to rely only on several constant factors and the elements of non-cyclically shifted ZC sequences which have already been generated. This preamble generation merely requires the storage of several constant factors, while avoids large storage and complex computation of complex exponential function.

show abstract

“…In addition, several efficient generations and correlations are also developed for PCSS [24][25][26][27][28]. The authors of [29,30] have proposed efficient calculation of fast Fourier transform (FFT) of ZC sequence. Also, an efficient correlation method for the corresponding ZCZ sequence set is developed in [13].…”

Section: Introductionmentioning

confidence: 99%

Joint timing synchronization and channel estimation based on ZCZ sequence set in SC-MIMO-FDE system

Wang

Sun

et al. 2016

J Wireless Com Network

View full text Add to dashboard Cite

In this paper, we investigate the channel estimation and time synchronization problem based on the zero correlation zone (ZCZ) sequence set for single carrier multiple-input multiple-output frequency domain equalization (SC-MIMO-FDE). A factorized construction of ZCZ sequence set considering the properties of both ZCZ and nonzero correlation zone (NCZ) is proposed with efficient generator and correlator, which can be in favor of timing synchronization and channel estimation both in performance and computation complexity. Using the ZCZ sequence set, a new algorithm called twice section-maximum algorithm is put forward to eliminate energy interference among channels from different transmitting antennas to the same receiving antenna. The performance achieved by the developed algorithm which performs joint timing synchronization and channel estimation with lower computational cost is better than that of the conventional method.

show abstract

Efficient computation of DFT of Zadoff-Chu sequences

Cited by 78 publications

References 3 publications

Quantum computing with parafermions

Quantum computing with parafermions

Random Access Preamble Generation with Low Storage for LTE Networks

Joint timing synchronization and channel estimation based on ZCZ sequence set in SC-MIMO-FDE system

Contact Info

Product

Resources

About