Journal ArticleDOI
The Minimum Decoding Delay of Maximum Rate Complex Orthogonal Space–Time Block Codes
Reads0
Chats0
TLDR
A tight lower bound on the decoding delay for maximum rate codes is shown, which is used to provide evidence that when the number of antennas is congruent to 2 modulo 4, the best achievable decoding delay is 2(m-1 2m_).Abstract:
The growing demand for efficient wireless transmissions over fading channels motivated the development of space-time block codes. Space-time block codes built from generalized complex orthogonal designs are particularly attractive because the orthogonality permits a simple decoupled maximum-likelihood decoding algorithm while achieving full transmit diversity. The two main research problems for these complex orthogonal space-time block codes (COSTBCs) have been to determine for any number of antennas the maximum rate and the minimum decoding delay for a maximum rate code. The maximum rate for COSTBCs was determined by Liang in 2003. This paper addresses the second fundamental problem by providing a tight lower bound on the decoding delay for maximum rate codes. It is shown that for a maximum rate COSTBC for 2m - 1 or 2m antennas, a tight lower bound on decoding delay is r = (m-1 2m) . This lower bound on decoding delay is achievable when the number of antennas is congruent to 0, 1, or 3 modulo 4. This paper also derives a tight lower bound on the number of variables required to construct a maximum rate COSTBC for any given number of antennas. Furthermore, it is shown that if a maximum rate COSTBC has a decoding delay of r where r < r les 2r, then r=2r. This is used to provide evidence that when the number of antennas is congruent to 2 modulo 4, the best achievable decoding delay is 2(m-1 2m_).read more
Citations
More filters
Journal ArticleDOI
The Final Case of the Decoding Delay Problem for Maximum Rate Complex Orthogonal Designs
TL;DR: The final case is addressed, and it is shown that when the number of columns is congruent to 2 modulo 4, the lower bound on decoding delay cannot be achieved and the shortest decoding delay a maximum rate COD can achieve is twice the lowerbound.
Journal ArticleDOI
Complex Orthogonal Designs With Forbidden 2 $\,\times\,$ 2 Submatrices
Yuan Li,Haibin Kan +1 more
TL;DR: In this paper, the existence of first-type CODs with parameters [p, n, k] was proved by explicit-form constructions, and all maximal rate, minimal delay, and their uniqueness under equivalence operation was proved.
Journal ArticleDOI
Novel Classes of Minimal Delay and Low PAPR Rate ${1\over 2}$ Complex Orthogonal Designs
Sarah Spence Adams,James A. Davis,Nathaniel J. Karst,Mathav Murugan,B Lee,M Crawford,C Greeley +6 more
TL;DR: An elegant construction is provided for a class of rate 1/2 CODs that have no zero entries, effectively no irrational coefficients, no linear processing, and have each variable appearing exactly twice per column, and the resulting codes meet the exact minimum decoding delay in most cases.
Journal ArticleDOI
A Novel Sensitivity Analysis Method in Structural Performance of Hydraulic Press
TL;DR: In this paper, a novel sensitivity analysis method in structural performance of hydraulic press, which saves a great deal of time and design costs, is presented, and the key dimension parameters of the optimization of design variables, which remarkably impact on the structural performance, are efficiently selected.
Journal ArticleDOI
Performance of In-Band Transmission of System Information in Massive MIMO Systems
TL;DR: It is shown that a massive MIMO base station can outperform a single-antenna base station in all considered scenarios.
References
More filters
Journal ArticleDOI
A simple transmit diversity technique for wireless communications
TL;DR: This paper presents a simple two-branch transmit diversity scheme that provides the same diversity order as maximal-ratio receiver combining (MRRC) with one transmit antenna, and two receive antennas.
Journal ArticleDOI
Capacity of Multi‐antenna Gaussian Channels
TL;DR: In this paper, the authors investigate the use of multiple transmitting and/or receiving antennas for single user communications over the additive Gaussian channel with and without fading, and derive formulas for the capacities and error exponents of such channels, and describe computational procedures to evaluate such formulas.
Journal ArticleDOI
Space-time block codes from orthogonal designs
TL;DR: A generalization of orthogonal designs is shown to provide space-time block codes for both real and complex constellations for any number of transmit antennas and it is shown that many of the codes presented here are optimal in this sense.
Journal ArticleDOI
Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas
TL;DR: This paper addresses digital communication in a Rayleigh fading environment when the channel characteristic is unknown at the transmitter but is known (tracked) at the receiver with the aim of leveraging the already highly developed 1-D codec technology.
Journal ArticleDOI
From theory to practice: an overview of MIMO space-time coded wireless systems
TL;DR: An overview of progress in the area of multiple input multiple output (MIMO) space-time coded wireless systems is presented and the state of the art in channel modeling and measurements is presented, leading to a better understanding of actual MIMO gains.