Golden Code Spatiotemporal Decoding via Layered Lattice Reduction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current decoding algorithms for Golden Code space-time codes do not effectively utilize the diversity and algebraic structure of the code, leading to suboptimal performance in fading channels, particularly in real-time applications.
Innovation Solution
A method involving MMSE-GDFE filtering, constellation refocusing, permutation, lattice base reduction, and layer-by-layer ZF-DFE decoding is employed to exploit the specific structure of Golden Code, optimizing the decoding process by handling diagonal matrices and reducing the problem dimensionally.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If Maximum Likelihood decoding is used for Golden Code, then decoding performance is optimized, but computational complexity becomes too high for real-time implementation
Solution Approach 1:
The patent segments the 8-dimensional lattice decoding problem into two separate 4-dimensional subproblems by exploiting the layer structure of Golden Code. The transmitted matrix is divided into two layers, and decoding is performed separately on each layer after appropriate permutation, reducing the overall computational complexity while maintaining near-optimal performance.
Solution Approach 2:
The patent transforms the decoding problem from the time domain to the layer domain by permuting the received signal vector. This dimensional transformation allows the receiver to exploit the algebraic structure of Golden Code and decode each layer independently, effectively reducing the search space from 8 dimensions to two 4-dimensional problems.
2Adaptability or versatility
If standard lattice decoding algorithms are used without exploiting code structure, then general applicability is maintained, but decoding performance does not fully utilize code diversity
Solution Approach 1:
The patent applies local quality by treating the two layers of Golden Code differently through specific permutation patterns. The permutation matrix reorders the received signal to separate the layers, allowing the decoder to exploit the specific algebraic structure of each layer locally rather than treating all dimensions uniformly.
Solution Approach 2:
The patent performs preliminary permutation and layer separation before the actual decoding process. By reordering the received signal vector according to the specific permutation pattern and separating the layers in advance, the decoder is prepared to exploit the algebraic structure of Golden Code during the subsequent decoding step.
Data Source
AI summary
The invention concerns a method for decoding spatiotemporal codes, in particular Golden type code. The received vector is subjected to a MMSE- GDFE filtering, a constellation re-centering to define a Z-matrix, a permutation to obtain X-shaped matrices, a trellis base reduction and a ZF-DFE algorithm by processing the elements of the Z-matrix layer by layer. Each layer comprises both elements of the diagonal or anti-diagonal of the Z-matrix.


