Scrambling Code Generator Multiplexing for WCDMA
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for generating scrambling codes in WCDMA systems face issues of poor universality, long system delay, and low processing efficiency, particularly when dealing with multiple users and odd bit scrambling codes, due to limited code range and inefficient processing techniques.
Innovation Solution
The method involves acquiring initial sequences X0 and Y0, extending them (└N/M┘+1) times to generate extended sequences X* and Y*, and using phase offset column vectors to produce scrambling codes, allowing for any bit generation, improved universality, and efficient multiplexing of multiple users within the same system clock.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If one scrambling code generator is designed for each user, then the scrambling quality is improved, but the hardware expense increases
Solution Approach 1:
The patent implements a single scrambling code generator that can serve multiple users by introducing user-specific parameters (initialization values, phase offsets) that allow the same hardware to produce different scrambling codes for different users. This multi-functional approach eliminates the need for separate generators for each user while maintaining scrambling quality.
2Device complexity
If time division multiplexing scrambling code method is used, then hardware expense is reduced, but the processing ability is limited to one bit per time
Solution Approach 1:
The patent changes the parameters of the scrambling code generator (initialization values, phase offsets, seed values) to enable a single generator to produce multiple different scrambling codes. This allows the system to process multiple users simultaneously with the same hardware, dramatically improving processing ability from one bit per time to multiple bits per time while keeping hardware expenses low.
3Productivity
If 2M-bit scrambling code generation method is used, then the multiplexing efficiency is improved, but the range of producing scrambling code is limited to even bits
Solution Approach 1:
The patent introduces dynamic parameter selection where the generator can adaptively adjust its initialization values and phase offsets based on the required code length. This dynamic approach allows the system to generate scrambling codes of any length (odd or even bits) while maintaining high multiplexing efficiency, making the system versatile and universally applicable.
4Productivity
If 2M-bit scrambling code generation method is used, then multiplexing efficiency is improved, but the system delay increases and processing efficiency decreases
Solution Approach 1:
The patent pre-calculates and stores scrambling codes for multiple users in advance, allowing the system to quickly retrieve and apply the appropriate scrambling code without requiring multiple rotation cycles during actual processing. This preliminary preparation significantly reduces system delay while maintaining high multiplexing efficiency.
Data Source
Figure 1~2
Figure 3~5
Figure 6
AI summary
The present invention discloses a method and apparatus for generating a scrambling code, and the method includes: acquiring initial sequences X0, Y0; extending the initial sequences X0, Y0 for (└N/M┘+1) times, and obtaining extended sequences X*, Y*, wherein, the N is a positive integer, 0<M≦ 22, and "└ ┘ " denotes rounded down; acquiring phase offset column vectors; and generating the scrambling code according to the extended sequences X*, Y* and the phase offset column vectors. The apparatus includes: a first acquiring module, an extension module, a second acquiring module and a generation module. The technical scheme of the present invention can process more users, reduce the processing delay and greatly improve the processing efficiency in the same system clock.