Partitioned Pseudo Random Sequence Generation for Faster 5G Processing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The generation of pseudo random sequences (PRS) in 5G communications networks is computationally intensive and too slow for real-time processing environments, and the use of look-up-tables with pre-computed PRSs requires excessive memory resources.
Innovation Solution
The method involves subdividing PRS generation operations into partitions, determining PRS generation register values based on initial and pre-computed advancement values, and generating PRSs of arbitrary or predetermined lengths, which are then transmitted for data processing, allowing for parallel processing and reduced memory usage.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If step-by-step PRS generation algorithms are used, then PRS can be generated with good pseudo random properties, but the processing speed is too slow for real-time environments
Solution Approach 1:
The PRS generation process is divided into multiple partitions, where each partition is generated independently using the same algorithm. This allows parallel processing of multiple partitions simultaneously, significantly improving processing speed while maintaining the quality of individual PRS segments through concatenation to form the complete sequence.
2Productivity
If look-up-tables with pre-computed PRSs are used, then processing speed is improved, but memory resources are excessively consumed
Solution Approach 1:
Instead of storing complete pre-computed PRS sequences in memory, the invention segments the PRS generation into multiple smaller partitions. Each partition can be generated independently with minimal memory requirements, and the partitions are concatenated to form the complete PRS sequence, thereby reducing memory consumption while maintaining fast processing speed.
3Adaptability or versatility
If long PRS sequences are pre-computed and stored, then various applications can use them directly, but the memory storage requirements increase significantly
Solution Approach 1:
The PRS sequence is divided into multiple partitions that can be generated independently. Different applications can request specific partitions or combinations of partitions with different initial values, providing application flexibility without requiring storage of all possible long PRS sequences in memory.
Solution Approach 2:
The partition boundaries and generation parameters are pre-configured, allowing rapid generation of required PRS partitions on-demand. This preliminary setup enables flexible adaptation to different applications while maintaining low memory storage requirements, as partitions are generated only when needed rather than pre-stored.
Data Source
AI summary
A computer implemented method of generating a pseudo random sequence (PRS). The method comprises sub-dividing PRS generation operations into a plurality of PRS partitions. For each PRS partition, a PRS generation register value is determined based on an initial PRS value and a pre-computed PRS generation register advancement value. For each partition, the determined PRS generation register value is used to generate a PRS of an arbitrary or a predetermined length. The method includes transmitting the generated PRS to a computing module, device or system to perform a data processing function.