ZC sequence generation method and apparatus

Abstract

The invention relates to a ZC sequence generation method and apparatus, and relates to the technical field of communication. The method comprises the following steps: when a ZC sequence with a lengthof NZC and a sequence number of n is generated, performing double recursive operation on a function f(n) and a function g(n) to obtain f(n-1) and g(n-1); performing modulo operation according to the f(n-1), the g(n-1) and the length NZC to obtain an index value idx; and searching a preset lookup table according to the index value idx to obtain the ZC sequence with the sequence number of n. In thisway, a multiplier or a divider required in the modulo process in the prior art is avoided, and only an adder and a comparator are used in the whole process of generating the ZC sequence, thereby reducing the complexity of implementing the general ZC sequence by hardware, shortening the hardware processing delay, reducing the hardware implementation area, and reducing the hardware implementation power consumption, in addition, the method is not limited to the generation of the ZC sequence when k=0, and is also universal to the generation of ZC sequences in other scenes.

Description

technical field [0001] The present disclosure relates to the field of communication technologies, and in particular, to a method and device for generating a ZC sequence. Background technique [0002] ZC sequence, namely Zadoff-Chu sequence, is a constant envelope sequence in complex form. Due to its good autocorrelation and cross-correlation, it has been widely used in 4G LTE and subsequent wireless communication systems. For the 4GLTE system, the primary synchronization sequence (PSS), the random access sequence (PRACH), the PUCCH carrying the HARQ ACK / NACK response, and the Souding RS (SRS) all use different forms of ZC sequences. For the NB-IOT system, the primary synchronization sequence (NPSS) and the secondary synchronization sequence also use the characteristics of the ZC sequence. a length N ZC The formula of the ZC sequence is as follows, [0003] [0004] Among them, q∈{1,2,...,N in the formula ZC -1} is the root index of the ZC sequence, n in the formula re...

AI Technical Summary

Problems solved by technology

However, the implementation method with reduced complexity still cannot avoid using at least one of the multiplier and the divider in the use of hardware, so the hardware area and power consumption are still not low enough

And in the existing improvement methods, generally all are to the realization of the simplified ZC sequence, that is, k=0 in the default formula (1), which is aimed at the ZC sequence in LTE or NB-IOT, and for the general ZC The implementation method of the sequence, that is, the implementation method of the ZC sequence in the case of k≠0 has not been improved. The implementation method of the general ZC sequence is still very complicated, the hardware implementation is complicated, the implementation area is large, and the power consumption is high.

Images