FHT operation and FPGA implementation based on 2n-1 m sequence
In the ground 4G/5G mobile communication,the Secondary Synchronization Signal(SSS)is composed of small m sequences with length of 31 and 127,and Fast Hadamard Transform(FHT)is usually used to reduce the amount of computation and reduce the use of computation resources in the calculation of maximum correlation value,however,there is no extended description for FHT derivation of sequences of any length.In this paper,a complete matrix derivation is given for the row-column transformation process from small m sequence of arbitrary 2n-1 length to FHT operation,and the small m sequence with length of 3 is adopted for simulation to verify the correctness of the conclusion.Finally,the FPGA implementation of FHT is completed by utilizing the SSS sequence with the length of 127 in the 5G standard.
NETL
NSTL
万方数据
