Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userInteger Space-Time Block Codes for Practical MIMO Systems
134
0
0.0
(
0
)
Added by
Harshan Jagadeesh
Publication date
2013
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
Full-rate space-time block codes (STBCs) achieve high spectral-efficiency by transmitting linear combinations of information symbols through every transmit antenna. However, the coefficients used for the linear combinations, if not chosen carefully, results in ({em i}) large number of processor bits for the encoder and ({em ii}) high peak-to-average power ratio (PAPR) values. In this work, we propose a new class of full-rate STBCs called Integer STBCs (ICs) for multiple-input multiple-output (MIMO) fading channels. A unique property of ICs is the presence of integer coefficients in the code structure which enables reduced numbers of processor bits for the encoder and lower PAPR values. We show that the reduction in the number of processor bits is significant for small MIMO channels, while the reduction in the PAPR is significant for large MIMO channels. We also highlight the advantages of the proposed codes in comparison with the well known full-rate algebraic STBCs.
rate research
Read More
In multiple-input multiple-output (MIMO) fading channels, the design criterion for full-diversity space-time block codes (STBCs) is primarily determined by the decoding method at the receiver. Although constructions of STBCs have predominantly matched the maximum-likelihood (ML) decoder, design criteria and constructions of full-diversity STBCs have also been reported for low-complexity linear receivers. A new receiver architecture called Integer-Forcing (IF) linear receiver has been proposed to MIMO channels by Zhan et al. which showed promising results for the high-rate V-BLAST encoding scheme. In this paper, we address the design of full-diversity STBCs for IF linear receivers. In particular, we are interested in characterizing the structure of STBCs that provide full-diversity with the IF receiver. Along that direction, we derive an upper bound on the probability of decoding error, and show that STBCs that satisfy the restricted non-vanishing singular value (RNVS) property provide full-diversity for the IF receiver. Furthermore, we prove that all known STBCs with the non-vanishing determinant property provide full-diversity with IF receivers, as they guarantee the RNVS property. By using the formulation of RNVS property, we also prove the existence of a full-diversity STBC outside the class of perfect STBCs, thereby adding significant insights compared to the existing works on STBCs with IF decoding. Finally, we present extensive simulation results to demonstrate that linear designs with RNVS property provide full-diversity for IF receiver.
begin{abstract} In this paper we consider Time-Varying Block (TVB) codes, which generalize a number of previous synchronization error-correcting codes. We also consider various practical issues related to MAP decoding of these codes. Specifically, we give an expression for the expected distribution of drift between transmitter and receiver due to synchronization errors. We determine an appropriate choice for state space limits based on the drift probability distribution. In turn, we obtain an expression for the decoder complexity under given channel conditions in terms of the state space limits used. For a given state space, we also give a number of optimizations that reduce the algorithm complexity with no further loss of decoder performance. We also show how the MAP decoder can be used in the absence of known frame boundaries, and demonstrate that an appropriate choice of decoder parameters allows the decoder to approach the performance when frame boundaries are known, at the expense of some increase in complexity. Finally, we express some existing constructions as TVB codes, comparing performance with published results, and showing that improved performance is possible by taking advantage of the flexibility of TVB codes.
Multicasting is the general method of conveying the same information to multiple users over a broadcast channel. In this work, the Gaussian MIMO broadcast channel is considered, with multiple users and any number of antennas at each node. A closed loop scenario is assumed, for which a practical capacity-achieving multicast scheme is constructed. In the proposed scheme, linear modulation is carried over time and space together, which allows to transform the problem into that of transmission over parallel scalar sub-channels, the gains of which are equal, except for a fraction of sub-channels that vanishes with the number of time slots used. Over these sub-channels, off-the-shelf fixed-rate AWGN codes can be used to approach capacity.
In this paper we present a block coded modulation scheme for a 2 x 2 MIMO system over slow fading channels, where the inner code is the Golden Code. The scheme is based on a set partitioning of the Golden Code using two-sided ideals whose norm is a power of two. In this case, a lower bound for the minimum determinant is given by the minimum Hamming distance. The description of the ring structure of the quotients suggests further optimization in order to improve the overall distribution of determinants. Performance simulations show that the GC-RS schemes achieve a significant gain over the uncoded Golden Code.
In this paper the performance limits and design principles of rateless codes over fading channels are studied. The diversity-multiplexing tradeoff (DMT) is used to analyze the system performance for all possible transmission rates. It is revealed from the analysis that the design of such rateless codes follows the design principle of approximately universal codes for parallel multiple-input multiple-output (MIMO) channels, in which each sub-channel is a MIMO channel. More specifically, it is shown that for a single-input single-output (SISO) channel, the previously developed permutation codes of unit length for parallel channels having rate LR can be transformed directly into rateless codes of length L having multiple rate levels (R, 2R, . . ., LR), to achieve the DMT performance limit.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
