20 research outputs found
Four-Group Decodable Space-Time Block Codes
Two new rate-one full-diversity space-time block codes (STBC) are proposed.
They are characterized by the \emph{lowest decoding complexity} among the known
rate-one STBC, arising due to the complete separability of the transmitted
symbols into four groups for maximum likelihood detection. The first and the
second codes are delay-optimal if the number of transmit antennas is a power of
2 and even, respectively. The exact pair-wise error probability is derived to
allow for the performance optimization of the two codes. Compared with existing
low-decoding complexity STBC, the two new codes offer several advantages such
as higher code rate, lower encoding/decoding delay and complexity, lower
peak-to-average power ratio, and better performance.Comment: 1 figure. Accepted for publication in IEEE Trans. on Signal
Processin
A New Low-Complexity Decodable Rate-1 Full-Diversity 4 x 4 STBC with Nonvanishing Determinants
Space-time coding techniques have become common-place in wireless
communication standards as they provide an effective way to mitigate the fading
phenomena inherent in wireless channels. However, the use of Space-Time Block
Codes (STBCs) increases significantly the optimal detection complexity at the
receiver unless the low complexity decodability property is taken into
consideration in the STBC design. In this letter we propose a new
low-complexity decodable rate-1 full-diversity 4 x 4 STBC. We provide an
analytical proof that the proposed code has the Non-Vanishing-Determinant (NVD)
property, a property that can be exploited through the use of adaptive
modulation which changes the transmission rate according to the wireless
channel quality. We compare the proposed code to existing low-complexity
decodable rate-1 full-diversity 4 x 4 STBCs in terms of performance over
quasi-static Rayleigh fading channels, detection complexity and Peak-to-Average
Power Ratio (PAPR). Our code is found to provide the best performance and the
smallest PAPR which is that of the used QAM constellation at the expense of a
slight increase in detection complexity w.r.t. certain previous codes but this
will only penalize the proposed code for high-order QAM constellations.Comment: 5 pages, 3 figures, and 1 table; IEEE Transactions on Wireless
Communications, Vol. 10, No. 8, AUGUST 201
A Novel Construction of Multi-group Decodable Space-Time Block Codes
Complex Orthogonal Design (COD) codes are known to have the lowest detection
complexity among Space-Time Block Codes (STBCs). However, the rate of square
COD codes decreases exponentially with the number of transmit antennas. The
Quasi-Orthogonal Design (QOD) codes emerged to provide a compromise between
rate and complexity as they offer higher rates compared to COD codes at the
expense of an increase of decoding complexity through partially relaxing the
orthogonality conditions. The QOD codes were then generalized with the so
called g-symbol and g-group decodable STBCs where the number of orthogonal
groups of symbols is no longer restricted to two as in the QOD case. However,
the adopted approach for the construction of such codes is based on sufficient
but not necessary conditions which may limit the achievable rates for any
number of orthogonal groups. In this paper, we limit ourselves to the case of
Unitary Weight (UW)-g-group decodable STBCs for 2^a transmit antennas where the
weight matrices are required to be single thread matrices with non-zero entries
in {1,-1,j,-j} and address the problem of finding the highest achievable rate
for any number of orthogonal groups. This special type of weight matrices
guarantees full symbol-wise diversity and subsumes a wide range of existing
codes in the literature. We show that in this case an exhaustive search can be
applied to find the maximum achievable rates for UW-g-group decodable STBCs
with g>1. For this purpose, we extend our previously proposed approach for
constructing UW-2-group decodable STBCs based on necessary and sufficient
conditions to the case of UW-g-group decodable STBCs in a recursive manner.Comment: 12 pages, and 5 tables, accepted for publication in IEEE transactions
on communication
A fast-decodable code structure for linear dispersion codes
This paper proposes the design of a new family of fast-decodable, full-rank, flexible-rate linear dispersion codes (LDCs) for MIMO systems with arbitrary numbers of transmit and receive antennas. The codewords of LDCs can be expressed as a linear combination of certain dispersion matrices and, in this new family of LDCs, we propose to have orthogonal rows in as many dispersion matrices as possible. We show that, with the proposed code, the number of levels in the tree search and hence the complexity of the sphere decoder (SD) at the receiver can be substantially reduced. Monte Carlo computer simulation has shown that the LDCs with and without the orthogonal structure have nearly identical bit-error-rate (BER) performances. However, the complexity of the SD used for decoding the proposed family of LDCs is substantially reduced. © 2009 IEEE.published_or_final_versio
Full Diversity Space-Time Block Codes with Low-Complexity Partial Interference Cancellation Group Decoding
Partial interference cancellation (PIC) group decoding proposed by Guo and
Xia is an attractive low-complexity alternative to the optimal processing for
multiple-input multiple-output (MIMO) wireless communications. It can well deal
with the tradeoff among rate, diversity and complexity of space-time block
codes (STBC). In this paper, a systematic design of full-diversity STBC with
low-complexity PIC group decoding is proposed. The proposed code design is
featured as a group-orthogonal STBC by replacing every element of an Alamouti
code matrix with an elementary matrix composed of multiple diagonal layers of
coded symbols. With the PIC group decoding and a particular grouping scheme,
the proposed STBC can achieve full diversity, a rate of and a
low-complexity decoding for transmit antennas. Simulation results show that
the proposed codes can achieve the full diversity with PIC group decoding while
requiring half decoding complexity of the existing codes.Comment: 10 pages, 3 figures
An Adaptive Conditional Zero-Forcing Decoder with Full-diversity, Least Complexity and Essentially-ML Performance for STBCs
A low complexity, essentially-ML decoding technique for the Golden code and
the 3 antenna Perfect code was introduced by Sirianunpiboon, Howard and
Calderbank. Though no theoretical analysis of the decoder was given, the
simulations showed that this decoding technique has almost maximum-likelihood
(ML) performance. Inspired by this technique, in this paper we introduce two
new low complexity decoders for Space-Time Block Codes (STBCs) - the Adaptive
Conditional Zero-Forcing (ACZF) decoder and the ACZF decoder with successive
interference cancellation (ACZF-SIC), which include as a special case the
decoding technique of Sirianunpiboon et al. We show that both ACZF and ACZF-SIC
decoders are capable of achieving full-diversity, and we give sufficient
conditions for an STBC to give full-diversity with these decoders. We then show
that the Golden code, the 3 and 4 antenna Perfect codes, the 3 antenna Threaded
Algebraic Space-Time code and the 4 antenna rate 2 code of Srinath and Rajan
are all full-diversity ACZF/ACZF-SIC decodable with complexity strictly less
than that of their ML decoders. Simulations show that the proposed decoding
method performs identical to ML decoding for all these five codes. These STBCs
along with the proposed decoding algorithm outperform all known codes in terms
of decoding complexity and error performance for 2,3 and 4 transmit antennas.
We further provide a lower bound on the complexity of full-diversity
ACZF/ACZF-SIC decoding. All the five codes listed above achieve this lower
bound and hence are optimal in terms of minimizing the ACZF/ACZF-SIC decoding
complexity. Both ACZF and ACZF-SIC decoders are amenable to sphere decoding
implementation.Comment: 11 pages, 4 figures. Corrected a minor typographical erro
Achieving Low-Complexity Maximum-Likelihood Detection for the 3D MIMO Code
The 3D MIMO code is a robust and efficient space-time block code (STBC) for
the distributed MIMO broadcasting but suffers from high maximum-likelihood (ML)
decoding complexity. In this paper, we first analyze some properties of the 3D
MIMO code to show that the 3D MIMO code is fast-decodable. It is proved that
the ML decoding performance can be achieved with a complexity of O(M^{4.5})
instead of O(M^8) in quasi static channel with M-ary square QAM modulations.
Consequently, we propose a simplified ML decoder exploiting the unique
properties of 3D MIMO code. Simulation results show that the proposed
simplified ML decoder can achieve much lower processing time latency compared
to the classical sphere decoder with Schnorr-Euchner enumeration
Generalized Silver Codes
For an transmit, receive antenna system (
system), a {\it{full-rate}} space time block code (STBC) transmits complex symbols per channel use. The well known Golden code is an
example of a full-rate, full-diversity STBC for 2 transmit antennas. Its
ML-decoding complexity is of the order of for square -QAM. The
Silver code for 2 transmit antennas has all the desirable properties of the
Golden code except its coding gain, but offers lower ML-decoding complexity of
the order of . Importantly, the slight loss in coding gain is negligible
compared to the advantage it offers in terms of lowering the ML-decoding
complexity. For higher number of transmit antennas, the best known codes are
the Perfect codes, which are full-rate, full-diversity, information lossless
codes (for ) but have a high ML-decoding complexity of the order
of (for , the punctured Perfect codes are
considered). In this paper, a scheme to obtain full-rate STBCs for
transmit antennas and any with reduced ML-decoding complexity of the
order of , is presented. The codes constructed are
also information lossless for , like the Perfect codes and allow
higher mutual information than the comparable punctured Perfect codes for . These codes are referred to as the {\it generalized Silver codes},
since they enjoy the same desirable properties as the comparable Perfect codes
(except possibly the coding gain) with lower ML-decoding complexity, analogous
to the Silver-Golden codes for 2 transmit antennas. Simulation results of the
symbol error rates for 4 and 8 transmit antennas show that the generalized
Silver codes match the punctured Perfect codes in error performance while
offering lower ML-decoding complexity.Comment: Accepted for publication in the IEEE Transactions on Information
Theory. This revised version has 30 pages, 7 figures and Section III has been
completely revise
Single-Symbol ML Decodable Distributed STBCs for Partially-Coherent Cooperative Networks
Space-time block codes (STBCs) that are single-symbol decodable (SSD) in a
co-located multiple antenna setting need not be SSD in a distributed
cooperative communication setting. A relay network with N relays and a single
source-destination pair is called a partially-coherent relay channel (PCRC) if
the destination has perfect channel state information (CSI) of all the channels
and the relays have only the phase information of the source-to-relay channels.
In this paper, first, a new set of necessary and sufficient conditions for a
STBC to be SSD for co-located multiple antenna communication is obtained. Then,
this is extended to a set of necessary and sufficient conditions for a
distributed STBC (DSTBC) to be SSD for a PCRC, by identifying the additional
conditions. Using this, several SSD DSTBCs for PCRC are identified among the
known classes of STBCs. It is proved that even if a SSD STBC for a co-located
MIMO channel does not satisfy the additional conditions for the code to be SSD
for a PCRC, single-symbol decoding of it in a PCRC gives full-diversity and
only coding gain is lost. It is shown that when a DSTBC is SSD for a PCRC, then
arbitrary coordinate interleaving of the in-phase and quadrature-phase
components of the variables does not disturb its SSD property for PCRC.
Finally, it is shown that the possibility of {\em channel phase compensation}
operation at the relay nodes using partial CSI at the relays increases the
possible rate of SSD DSTBCs from when the relays do not have CSI
to 1/2, which is independent of N