Partial Pseudo-Randomization for Grant-Free Signal Decoding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In grant-free transmission scenarios, uncertainty in user detection leads to performance degradation in descrambling and decoding due to unknown scrambling codes, and collisions between reference signals and scrambling codes result in insufficient interference randomness and inaccurate channel estimation, increasing residual interference and reducing demodulation performance.
Innovation Solution
A partial pseudo-randomization processing method where pseudo-randomization is performed on part of the bits to be encoded, allowing for improved interference randomization and reduced decoding complexity by generating new bits that are then encoded, and pseudo-randomization removing processing is performed on decoded bits to recover the original bits before transmission, ensuring accurate channel estimation and interference cancellation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If pseudo-randomization processing is performed on the bit sequence before encoding, then interference randomization is achieved and detection performance is improved, but the receiving side cannot perform descrambling before decoding due to unknown scrambling codes, leading to performance degradation
Solution Approach 1:
The patent applies preliminary pseudo-randomization processing to the information bits before encoding. The receiver performs channel estimation and interference cancellation first, then uses the recovered information bits to generate the scrambling code, and finally performs descrambling on the encoded bits. This preliminary action on the transmitting side enables the receiver to overcome the unknown scrambling code problem by obtaining it through intermediate processing steps.
Solution Approach 2:
The patent segments the bit processing into distinct stages: pseudo-randomization of information bits before encoding, encoding, channel transmission, channel estimation, interference cancellation, information bit recovery, scrambling code generation, and descrambling. This segmentation allows the receiver to perform operations in a specific sequence that resolves the contradiction between maintaining interference randomization and enabling descrambling.
2Productivity
If the receiving side performs descrambling before FEC decoding using existing scrambling code schemes, then decoding can proceed, but user detection uncertainty and collisions between reference signals and scrambling codes result in insufficient interference randomness and inaccurate channel estimation
Solution Approach 1:
The patent applies preliminary pseudo-randomization to information bits before encoding. The receiver performs channel estimation and interference cancellation using pilot signals first, then recovers information bits, generates the scrambling code, and finally performs descrambling. This preliminary action ensures that channel estimation and interference cancellation are performed with accurate knowledge of the scrambling effect, eliminating the problems of user detection uncertainty and reference signal collisions.
3Reliability
If pseudo-randomization is applied to all bits, then maximum interference randomization is achieved, but encoding and decoding complexity increases
Solution Approach 1:
The patent applies pseudo-randomization processing only to the information bits before encoding, rather than to all transmitted bits. This partial action achieves the essential interference randomization effect on the data portion while avoiding the increased complexity that would result from pseudo-randomizing the entire bit sequence including encoded bits.
Data Source
AI summary
Provided are a partial pseudo-randomization processing method, a corresponding apparatus, a device and a storage medium. The method includes performing pseudo-randomization processing on part of N bits b1, b2, . . . , bN to generate new N bits d1, d2, . . . , dN; and encoding the d1, d2, . . . , dN.