Fundamentals of wireless communication
Fundamentals of wireless communication
On full diversity space-time block codes with partial interference cancellation group decoding
IEEE Transactions on Information Theory
High-rate, multisymbol-decodable STBCs from Clifford algebras
IEEE Transactions on Information Theory
IEEE Transactions on Signal Processing
Linear dispersion codes for MIMO systems based on frame theory
IEEE Transactions on Signal Processing
Four-Group Decodable Space–Time Block Codes
IEEE Transactions on Signal Processing
Quasi-orthogonal STBC with minimum decoding complexity
IEEE Transactions on Wireless Communications
IEEE Transactions on Information Theory
Space-time block codes from orthogonal designs
IEEE Transactions on Information Theory
A universal lattice code decoder for fading channels
IEEE Transactions on Information Theory
Space-time block codes: a maximum SNR approach
IEEE Transactions on Information Theory
High-rate codes that are linear in space and time
IEEE Transactions on Information Theory
Capacity-approaching space-time codes for systems employing four transmitter antennas
IEEE Transactions on Information Theory
Orthogonal designs with maximal rates
IEEE Transactions on Information Theory
Full-diversity, high-rate space-time block codes from division algebras
IEEE Transactions on Information Theory
Upper bounds of rates of complex orthogonal space-time block codes
IEEE Transactions on Information Theory
On the nonexistence of rate-one generalized complex orthogonal designs
IEEE Transactions on Information Theory
Signal constellations for quasi-orthogonal space-time block codes with full diversity
IEEE Transactions on Information Theory
The golden code: a 2×2 full-rate space-time code with nonvanishing determinants
IEEE Transactions on Information Theory
STBC-schemes with nonvanishing determinant for certain number of transmit antennas
IEEE Transactions on Information Theory
An algebraic family of complex lattices for fading channels with application to space-time codes
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Single-symbol maximum likelihood decodable linear STBCs
IEEE Transactions on Information Theory
Explicit Space–Time Codes Achieving the Diversity–Multiplexing Gain Tradeoff
IEEE Transactions on Information Theory
Perfect Space–Time Block Codes
IEEE Transactions on Information Theory
Perfect Space–Time Codes for Any Number of Antennas
IEEE Transactions on Information Theory
Space–Time Block Codes Achieving Full Diversity With Linear Receivers
IEEE Transactions on Information Theory
A simple transmit diversity technique for wireless communications
IEEE Journal on Selected Areas in Communications
On full diversity space-time block codes with partial interference cancellation group decoding
IEEE Transactions on Information Theory
High-rate full-diversity space-time block codes with linear receivers
ISWCS'09 Proceedings of the 6th international conference on Symposium on Wireless Communication Systems
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
IEEE Transactions on Information Theory
Hi-index | 754.96 |
In this paper, we propose a partial interference cancellation (PIC) group decoding strategy/scheme for linear dispersive space-time block codes (STBC) and a design criterion for the codes to achieve full diversity when the PIC group decoding is used at the receiver. A PIC group decoding decodes the symbols embedded in an STBC by dividing them into several groups and decoding each group separately after a linear PIC operation is implemented. It can be viewed as an intermediate decoding between the maximum likelihood (ML) receiver that decodes aU the embedded symbols together, i.e., all the embedded symbols are in a single group, and the zero-forcing (ZF) receiver that decodes all the embedded symbols separately and independently, i.e., each group has and only has one embedded symbol, after the ZF operation is implemented. The PIC group decoding provides a framework to adjust the complexity-performance tradeoff by choosing the sizes of the information symbol groups. Our proposed design criterion (group independence) for the PIC group decoding to achieve full diversity is an intermediate condition between the loosest ML full rank criterion of codewords and the strongest ZF linear independence condition of the column vectors in the equivalent channel matrix. We also propose asymptotic optimal (AO) group decoding algorithm which is an intermediate decoding between the MMSE decoding algorithm and the ML decoding algorithm. The design criterion for the PIC group decoding can be applied to the AO group decoding algorithm because of its asymptotic optimality. It is well-known that the symbol rate for a full rank linear STBC can be full, i.e., nt, for nt transmit antennas. It has been recently shown that its rate is upper bounded by 1 if a code achieves full diversity with a linear receiver. The intermediate criterion proposed in this paper provides the possibility for codes of rates between nt and 1 that achieve full diversity with the PIC group decoding. This therefore provides a complexity-performance-rate tradeoff. Some design examples are given.