Local Interleaver Architecture for Buffered Turbo Equalization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing turbo decoding methods require high complexity global interleavers, leading to increased memory usage and latency due to the need to buffer entire sectors before data can be processed, which complicates the decoding process in communication and data storage channels.
Innovation Solution
Implementing a plurality of local interleavers to replace the single global interleaver, allowing for efficient decoding by breaking down data into smaller blocks and interleaving each block independently, reducing memory usage and latency while maintaining performance comparable to global interleavers.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a global interleaver is used for turbo decoding, then decoding performance is maintained, but memory usage and latency increase due to buffering entire sectors
Solution Approach 1:
The patent divides the sector data into multiple blocks, with each block processed by a separate local interleaver. This segmentation allows each interleaver to handle only a portion of the data (e.g., one block column of the H-matrix), reducing the memory buffer size from entire sector to individual block size while maintaining decoding performance through distributed processing.
2Reliability
If a global interleaver is used for turbo decoding, then decoding performance is maintained, but processing latency increases due to buffering requirements
Solution Approach 1:
By segmenting the decoding process into multiple parallel local interleavers, the patent enables concurrent processing of different data blocks. This eliminates the sequential buffering requirement of global interleavers, reducing latency as data can be returned immediately after each local block is processed rather than waiting for entire sector buffering.
Solution Approach 2:
The patent performs preliminary organization of data into block columns corresponding to the H-matrix structure before distribution to local interleavers. This preliminary action enables efficient parallel processing and reduces the need for extensive buffering during the actual decoding process, thereby reducing latency.
3Reliability
If a global interleaver is used for turbo decoding, then decoding performance is maintained, but computation requirements increase
Solution Approach 1:
The patent segments the computation workload across multiple local interleavers, each handling a specific block column of the H-matrix. This distribution reduces the computation burden on any single processing unit compared to a global interleaver that must process the entire sector sequentially, while maintaining overall decoding performance through the collective work of all local interleavers.
Data Source
AI summary
A plurality of “local” interleavers replaces a single global interleaver for processing encoded data. If the encoded data may be represented as a matrix of data blocks, or “circulants,” each local interleaver can be the size of one or a small number of circulants. Thus, for example, if the matrix has a certain number of rows and columns, the number of local interleavers may be equal to the number of columns. Each local interleaver is small so latency is low.