Zadoff-Chu Sequence Allocation Circuit Scale Reduction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The use of Zadoff-Chu sequences and GCL sequences in mobile communication systems for random access results in high calculation and circuit complexity due to complex multiplication requirements for code detection, which increases with the number of sequences allocated to a cell.
Innovation Solution
Allocating combinations of sequence numbers where the absolute values of the amplitudes of the coefficients' real and imaginary parts are equal, reducing the complexity of correlation calculations and circuit scale by utilizing pairs of sequences that are complex conjugates of each other.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If multiple Zadoff-Chu sequences or GCL sequences are allocated to one cell to improve detection characteristics and reduce collision rate, then the reliability of random access is improved, but the device complexity and calculation requirements increase proportionally
Solution Approach 1:
The patent combines multiple Zadoff-Chu sequences into groups where sequences within each group share the same absolute amplitude values for real and imaginary parts. By merging sequences with identical amplitude characteristics, the system can reduce the number of unique correlation calculations required, thereby reducing circuit scale while maintaining the ability to detect multiple sequences.
Solution Approach 2:
The patent changes the parameter of sequence allocation by grouping sequences according to their amplitude characteristics rather than treating all sequences equally. This parameter change allows the system to optimize the correlation circuit design by reducing the number of unique amplitude patterns that need to be handled, thus reducing overall circuit complexity.
2Reliability
If the number of different Zadoff-Chu sequences or GCL sequences used in one cell increases to reduce collision rate, then the reliability is improved, but the amount of calculation and circuit scale become proportional to the number of sequences allocated
Solution Approach 1:
The patent merges sequences with identical amplitude characteristics into groups, allowing the system to handle multiple sequences more efficiently. By combining sequences that require the same correlation calculations, the system reduces the total calculation burden while maintaining the ability to detect all allocated sequences.
Solution Approach 2:
The patent creates a universal correlation circuit design that can handle multiple sequence types by leveraging the shared amplitude characteristics. The correlation circuit is designed to process sequences in a way that allows one circuit structure to serve multiple sequence groups, reducing the overall calculation requirements.
3Reliability
If Zadoff-Chu sequences or GCL sequences with complex numbers are used for random access, then the detection characteristics are improved, but the correlation circuit requires complex multiplication for each element, increasing calculation and circuit scale
Solution Approach 1:
The patent combines sequences with identical amplitude characteristics, which allows the correlation circuit to use fewer unique multiplication patterns. By merging sequences that would otherwise require separate correlation processing, the system reduces the overall circuit scale while maintaining complex number处理能力.
Solution Approach 2:
The patent changes the approach to handling complex numbers by focusing on the amplitude characteristics rather than treating all complex elements uniformly. This parameter change allows for optimization of the correlation circuit by reducing the number of unique complex multiplication patterns that need to be implemented.
Data Source
AI summary
A sequence allocating method and apparatus wherein in a system where a plurality of different Zadoff-Chu sequences or GCL sequences are allocated to a single cell, the arithmetic amount and circuit scale of a correlating circuit at a receiving end can be reduced. In ST201, a counter (a) and a number (p) of current sequence allocations are initialized, and in ST202, it is determined whether the number (p) of current sequence allocations is coincident with a number (K) of allocations to one cell. In ST203, it is determined whether the number (K) of allocations to the one cell is odd or even. If K is even, in ST204-ST206, sequence numbers (r=a and r=N−a), which are not currently allocated, are combined and then allocated. If K is odd, in ST207-ST212, for sequences that cannot be paired, one of sequence numbers (r=a and r=N−a), which are not currently allocated, is allocated.