Space-Time Block Coding With Orthogonal Matrix Pairing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing wireless communication systems face challenges in generating Space-Time Block Codes (STBCs) that offer desired diversity order and coding rate while maintaining low decoding complexity, especially for multiple-input multiple-output (MIMO) systems with a large codebook size, which increases the complexity of maximum-likelihood (ML) decoding.
Innovation Solution
The method involves generating STBCs using linear dispersion matrices with component-wise conditions that ensure orthogonality between pairs of matrices, represented in a linear dispersion representation, to achieve target diversity order and coding rate, and reduce decoding complexity by exploiting the structure of the equivalent channel matrix.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If orthogonal designs are used to achieve full diversity and fast ML decoding, then diversity gain and decoding speed are improved, but the construction becomes difficult for more than four transmit antennas and coding rate is limited to one or lower
Solution Approach 1:
The patent segments the codebook into multiple subcodebooks, each containing a limited number of codewords that satisfy orthogonality conditions. This segmentation allows the system to maintain orthogonality benefits for small groups while extending applicability to any number of transmit antennas by selecting appropriate subcodebooks.
Solution Approach 2:
The patent applies orthogonality conditions locally within each subcodebook rather than requiring global orthogonality across the entire codebook. This local application of orthogonality maintains diversity gain while enabling flexible codebook construction for various antenna configurations.
2Productivity
If quasi-orthogonal designs are used to improve symbol rates, then coding rate is improved, but decoding complexity increases and full diversity is not achieved
Solution Approach 1:
The patent segments the codebook into subcodebooks with controlled sizes that balance symbol rate and decoding complexity. Each subcodebook is designed to contain a manageable number of codewords, preventing exponential complexity growth while maintaining high coding rates through efficient packing.
Solution Approach 2:
The patent changes the parameter of codebook organization from traditional orthogonal structures to segmented subcodebook structures with specific size constraints. This parameter change enables the system to achieve high symbol rates while keeping decoding complexity manageable through optimized subcodebook dimensions.
3Adaptability or versatility
If the codebook size is increased to accommodate more transmit antennas, then adaptability is improved, but ML decoding complexity increases significantly
Solution Approach 1:
The patent segments the large codebook into multiple smaller subcodebooks, each containing a limited number of codewords. This segmentation reduces the computational burden of ML decoding by limiting the search space within each subcodebook while maintaining adaptability to any number of transmit antennas through selective subcodebook usage.
Solution Approach 2:
The patent applies orthogonality conditions partially within each subcodebook rather than requiring all codewords in the entire codebook to satisfy orthogonality. This partial application reduces decoding complexity while maintaining sufficient diversity gain for reliable communication.
Data Source
AI summary
There is provided a method of generating a space-time block code (STBC) for encoding a digital data sequence comprising a set of independent symbols to be transmitted through a transmission channel in a communication system, the space-time block code being represented by a set of linear dispersion matrices in a linear dispersion representation, each linear dispersion matrix comprising components having complex values, the method comprising, generating at least some of the linear dispersion matrices depending on component-wise conditions related to a set of selected pairs of the linear dispersion matrices, each pair comprising a first linear dispersion matrix and a second linear dispersion matrix, said component-wise conditions comprising a component-wise condition between the components of the first linear dispersion matrix and the components of the second linear dispersion matrix.