9,362 research outputs found
Asymptotically-Optimal, Fast-Decodable, Full-Diversity STBCs
For a family/sequence of STBCs , with
increasing number of transmit antennas , with rates complex symbols
per channel use (cspcu), the asymptotic normalized rate is defined as . A family of STBCs is said to be
asymptotically-good if the asymptotic normalized rate is non-zero, i.e., when
the rate scales as a non-zero fraction of the number of transmit antennas, and
the family of STBCs is said to be asymptotically-optimal if the asymptotic
normalized rate is 1, which is the maximum possible value. In this paper, we
construct a new class of full-diversity STBCs that have the least ML decoding
complexity among all known codes for any number of transmit antennas and
rates cspcu. For a large set of pairs, the new codes
have lower ML decoding complexity than the codes already available in the
literature. Among the new codes, the class of full-rate codes () are
asymptotically-optimal and fast-decodable, and for have lower ML decoding
complexity than all other families of asymptotically-optimal, fast-decodable,
full-diversity STBCs available in the literature. The construction of the new
STBCs is facilitated by the following further contributions of this paper:(i)
For , we construct -group ML-decodable codes with rates greater than
one cspcu. These codes are asymptotically-good too. For , these are the
first instances of -group ML-decodable codes with rates greater than
cspcu presented in the literature. (ii) We construct a new class of
fast-group-decodable codes for all even number of transmit antennas and rates
.(iii) Given a design with full-rank linear dispersion
matrices, we show that a full-diversity STBC can be constructed from this
design by encoding the real symbols independently using only regular PAM
constellations.Comment: 16 pages, 3 tables. The title has been changed.The class of
asymptotically-good multigroup ML decodable codes has been extended to a
broader class of number of antennas. New fast-group-decodable codes and
asymptotically-optimal, fast-decodable codes have been include
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 Full-Rate STBC with High Coding Gain for 4x2 MIMO Systems
In this work, a new fast-decodable space-time block code (STBC) is proposed.
The code is full-rate and full-diversity for 4x2 multiple-input multiple-output
(MIMO) transmission. Due to the unique structure of the codeword, the proposed
code requires a much lower computational complexity to provide
maximum-likelihood (ML) decoding performance. It is shown that the ML decoding
complexity is only O(M^{4.5}) when M-ary square QAM constellation is used.
Finally, the proposed code has highest minimum determinant among the
fast-decodable STBCs known in the literature. Simulation results prove that the
proposed code provides the best bit error rate (BER) performance among the
state-of-the-art STBCs.Comment: 2013 IEEE 24th International Symposium on Personal Indoor and Mobile
Radio Communications (PIMRC), London : United Kingdom (2013
A Low-Complexity, Full-Rate, Full-Diversity 2 X 2 STBC with Golden Code's Coding Gain
This paper presents a low-ML-decoding-complexity, full-rate, full-diversity
space-time block code (STBC) for a 2 transmit antenna, 2 receive antenna
multiple-input multiple-output (MIMO) system, with coding gain equal to that of
the best and well known Golden code for any QAM constellation. Recently, two
codes have been proposed (by Paredes, Gershman and Alkhansari and by Sezginer
and Sari), which enjoy a lower decoding complexity relative to the Golden code,
but have lesser coding gain. The STBC presented in this paper has
lesser decoding complexity for non-square QAM constellations, compared with
that of the Golden code, while having the same decoding complexity for square
QAM constellations. Compared with the Paredes-Gershman-Alkhansari and
Sezginer-Sari codes, the proposed code has the same decoding complexity for
non-rectangular QAM constellations. Simulation results, which compare the
codeword error rate (CER) performance, are presented.Comment: Submitted to IEEE Globecom - 2008. 6 pages, 3 figures, 1 tabl
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
High-Rate Space-Time Coded Large MIMO Systems: Low-Complexity Detection and Channel Estimation
In this paper, we present a low-complexity algorithm for detection in
high-rate, non-orthogonal space-time block coded (STBC) large-MIMO systems that
achieve high spectral efficiencies of the order of tens of bps/Hz. We also
present a training-based iterative detection/channel estimation scheme for such
large STBC MIMO systems. Our simulation results show that excellent bit error
rate and nearness-to-capacity performance are achieved by the proposed
multistage likelihood ascent search (M-LAS) detector in conjunction with the
proposed iterative detection/channel estimation scheme at low complexities. The
fact that we could show such good results for large STBCs like 16x16 and 32x32
STBCs from Cyclic Division Algebras (CDA) operating at spectral efficiencies in
excess of 20 bps/Hz (even after accounting for the overheads meant for pilot
based training for channel estimation and turbo coding) establishes the
effectiveness of the proposed detector and channel estimator. We decode perfect
codes of large dimensions using the proposed detector. With the feasibility of
such a low-complexity detection/channel estimation scheme, large-MIMO systems
with tens of antennas operating at several tens of bps/Hz spectral efficiencies
can become practical, enabling interesting high data rate wireless
applications.Comment: v3: Performance/complexity comparison of the proposed scheme with
other large-MIMO architectures/detectors has been added (Sec. IV-D). The
paper has been accepted for publication in IEEE Journal of Selected Topics in
Signal Processing (JSTSP): Spl. Iss. on Managing Complexity in Multiuser MIMO
Systems. v2: Section V on Channel Estimation is update
- …