Results 1  10
of
57
Spacetime codes for high data rate wireless communication: Performance criterion and code construction
 IEEE TRANS. INFORM. THEORY
, 1998
"... We consider the design of channel codes for improving the data rate and/or the reliability of communications over fading channels using multiple transmit antennas. Data is encoded by a channel code and the encoded data is split into n streams that are simultaneously transmitted using n transmit ant ..."
Abstract

Cited by 1674 (27 self)
 Add to MetaCart
(Show Context)
We consider the design of channel codes for improving the data rate and/or the reliability of communications over fading channels using multiple transmit antennas. Data is encoded by a channel code and the encoded data is split into n streams that are simultaneously transmitted using n transmit antennas. The received signal at each receive antenna is a linear superposition of the n transmitted signals perturbed by noise. We derive performance criteria for designing such codes under the assumption that the fading is slow and frequency nonselective. Performance is shown to be determined by matrices constructed from pairs of distinct code sequences. The minimum rank among these matrices quantifies the diversity gain, while the minimum determinant of these matrices quantifies the coding gain. The results are then extended to fast fading channels. The design criteria are used to design trellis codes for high data rate wireless communication. The encoding/decoding complexity of these codes is comparable to trellis codes employed in practice over Gaussian channels. The codes constructed here provide the best tradeoff between data rate, diversity advantage, and trellis complexity. Simulation results are provided for 4 and 8 PSK signal sets with data rates of 2 and 3 bits/symbol, demonstrating excellent performance that is within 2–3 dB of the outage capacity for these channels using only 64 state encoders.
On the BCJR trellis for linear block codes
 IEEE Trans. Inform. Theory
, 1996
"... Abstruct In this semitutorial paper, we will investigate the computational complexity of an abstract version of the Viterbi algorithm on a trellis, and show that if the trellis has e edges, the complexity of the Viterbi algortithm is @(e). This result suggests that the “best ” trellis representati ..."
Abstract

Cited by 68 (0 self)
 Add to MetaCart
(Show Context)
Abstruct In this semitutorial paper, we will investigate the computational complexity of an abstract version of the Viterbi algorithm on a trellis, and show that if the trellis has e edges, the complexity of the Viterbi algortithm is @(e). This result suggests that the “best ” trellis representation for a given linear block code is the one with the fewest edges. We will then show that, among all trellises that represent a given code, the original trellis introduced by Bahl, Cocke, Jelinek, and Raviv in 1974, and later rediscovered by Wolf, Massey, and Forney, uniquely minimizes the edge count, as well as several other figures of merit. Following Forney and Kschischang and Sorokine, we will also discuss “trellisoriented ” or “minimalspan ” generator matrices, which facilitate the calculation of the size of the BCJR trellis, as well as the actual construction of it. Index TermsBlock complexity.
On the Complexity of Decoding Lattices Using the KorkinZolotarev Reduced Basis
 IEEE Trans. Inform. Theory
, 1998
"... Upper and lower bounds are derived for the decoding complexity of a general lattice L. The bounds are in terms of the dimension n and the coding gain fl of L, and are obtained based on a decoding algorithm which is an improved version of Kannan's method. The latter is currently the fastest know ..."
Abstract

Cited by 26 (0 self)
 Add to MetaCart
Upper and lower bounds are derived for the decoding complexity of a general lattice L. The bounds are in terms of the dimension n and the coding gain fl of L, and are obtained based on a decoding algorithm which is an improved version of Kannan's method. The latter is currently the fastest known method for the decoding of a general lattice. For the decoding of a point xx x, the proposed algorithm recursively searches inside an ndimensional rectangular parallelepiped (cube), centered at xx x, with its edges along the GramSchmidt vectors of a proper basis of L. We call algorithms of this type recursive cube search (RCS) algorithms. It is shown that Kannan's algorithm also belongs to this category. The complexity of RCS algorithms is measured in terms of the number of lattice points that need to be examined before a decision is made. To tighten the upper bound on the complexity, we select a lattice basis which is reduced in the sense of KorkinZolotarev. It is shown that for any selected basis, the decoding complexity (using RCS algorithms) of any (fl 1) grows at least exponentially with n and fl. It is observed that the densest lattices, and almost all of the lattices used in communications, e.g., BarnesWall lattices and the Leech lattice, have equal successive minima (ESM). For the decoding complexity of ESM lattices, a tighter upper bound and a stronger lower bound result are derived.
The Art of Signaling: Fifty Years of Coding Theory
, 1998
"... In 1948 Shannon developed fundamental limits on the efficiency of communication over noisy channels. The coding theorem asserts that there are block codes with code rates arbitrarily close to channel capacity and probabilities of error arbitrarily close to zero. Fifty years later, codes for the Gaus ..."
Abstract

Cited by 21 (0 self)
 Add to MetaCart
In 1948 Shannon developed fundamental limits on the efficiency of communication over noisy channels. The coding theorem asserts that there are block codes with code rates arbitrarily close to channel capacity and probabilities of error arbitrarily close to zero. Fifty years later, codes for the Gaussian channel have been discovered that come close to these fundamental limits. There is now a substantial algebraic theory of errorcorrecting codes with as many connections to mathematics as to engineering practice, and the last 20 years have seen the construction of algebraicgeometry codes that can be encoded and decoded in polynomial time, and that beat the Gilbert–Varshamov bound. Given the size of coding theory as a subject, this review is of necessity a personal perspective, and the focus is reliable communication, and not source coding or cryptography. The emphasis is on connecting coding theories for Hamming and Euclidean space and on future challenges, specifically in data networking, wireless communication, and quantum information theory.
Distributed Source Coding using Abelian Group Codes: Extracting Performance from Structure
"... In this work, we consider a distributed source coding problem with a joint distortion criterion depending on the sources and the reconstruction. This includes as a special case the problem of computing a function of the sources to within some distortion and also the classic SlepianWolf problem [12 ..."
Abstract

Cited by 21 (4 self)
 Add to MetaCart
(Show Context)
In this work, we consider a distributed source coding problem with a joint distortion criterion depending on the sources and the reconstruction. This includes as a special case the problem of computing a function of the sources to within some distortion and also the classic SlepianWolf problem [12], BergerTung problem [5], WynerZiv problem [4], YeungBerger problem [6] and the AhlswedeKornerWyner problem [3], [13]. While the prevalent trend in information theory has been to prove achievability results using Shannon’s random coding arguments, using structured random codes offer rate gains over unstructured random codes for many problems. Motivated by this, we present a new achievable ratedistortion region (an inner bound to the performance limit) for this problem for discrete memoryless sources based on “good” structured random nested codes built over abelian groups. We demonstrate rate gains for this problem over traditional coding schemes using random unstructured codes. For certain sources and distortion functions, the new rate region is strictly bigger than the BergerTung rate region, which has been the best known achievable rate region for this problem till now. Further, there is no known unstructured random coding scheme that achieves these rate gains. Achievable performance limits for singleuser source coding using abelian group codes are also obtained as parts of the proof of the main coding theorem. As a corollary, we also prove that nested linear codes achieve the Shannon ratedistortion bound in the singleuser setting. Note that while group codes retain some structure, they are more general than linear codes which can only be built over finite fields which are known to exist only for certain sizes.
Upper bound on the frame error probability of terminated trellis codes
 IEEE Commun. Lett
, 1998
"... Abstract — The frameerror rate (FER) of trellis codes with trellis termination can be approximated by considering the length of the error events negligible with respect to the frame length. In this letter we prove that this approximation is actually a true upper bound. This may be useful to orienta ..."
Abstract

Cited by 20 (1 self)
 Add to MetaCart
(Show Context)
Abstract — The frameerror rate (FER) of trellis codes with trellis termination can be approximated by considering the length of the error events negligible with respect to the frame length. In this letter we prove that this approximation is actually a true upper bound. This may be useful to orientate the design of framebased transmission systems directly in terms of FER instead of the more common but less significant biterror rate figure. Index Terms — Trelliscoded modulation performance. I. INTRODUCTION AND MOTIVATIONS IN MANY modern communication systems analog speech, audio and video signals are compressed and transmitted in digital form. Source encoders are normally frameoriented and produce frames of encoded data. In order to cope with
The Trellis Structure of Maximal FixedCost Codes
 IEEE TRANS. INFORM. THEORY
, 1996
"... We show that the family of maximal fixedcost (MFC) codes, with codeword costs defined in a rightcancellative semigroup, are rectangular, and hence admit biproper trellis presentations. Among all possible trellis presentations for a rectangular code, biproper trellises minimize a wide variety of co ..."
Abstract

Cited by 19 (1 self)
 Add to MetaCart
(Show Context)
We show that the family of maximal fixedcost (MFC) codes, with codeword costs defined in a rightcancellative semigroup, are rectangular, and hence admit biproper trellis presentations. Among all possible trellis presentations for a rectangular code, biproper trellises minimize a wide variety of complexity measures, including the Viterbi decoding complexity. Examples of MFC codes include such "nonlinear" codes as permutation codes, shells of constant norm in the integer lattice, and linear codes over a finite field. The intersection of two rectangular codes is another rectangular code; therefore "nonlinear" codes such as lattice shells or words of constant weight in a linear code have biproper trellis presentations. We show that every rectangular code can be interpreted as an MFC code. Applications of these results include error detection, trellisbased indexing, and softdecision decoding.
An Efficient Algorithm for Constructing Minimal Trellises for Codes over Finite Abelian Groups
, 1996
"... We present an efficient algorithm for computing the minimal trellis for a group code over a finite Abelian group, given a generator matrix for the code. We also show how to cornpure a succinct representation of the minimal trellis for such a code, andpresent algorithms that use this information to e ..."
Abstract

Cited by 18 (2 self)
 Add to MetaCart
We present an efficient algorithm for computing the minimal trellis for a group code over a finite Abelian group, given a generator matrix for the code. We also show how to cornpure a succinct representation of the minimal trellis for such a code, andpresent algorithms that use this information to efficiently compute local descriptions of the minimal trellis. This extends the work of Kschischang and Sorokine, who handled the case of linear codes over fields. An important application of our algorithms is to the construction qf minireal trellises for lattices. A key step in our work is handling codes over cyclic groups C'p, where p is a prime. Such a code can be viewed as a submodule over the ring Zp. Because of the presence of zerodivisors in the ring, submodules do not share the useful properties of vector spaces. We get around this difficulty by restricting the notion of linear combination to plinear combination, and introducing the notion of a pgenerator equence, which enjoys properties similar to that of a generector matrix for a vector space.
On the Theory of Linear Trellises
 in Information, Coding and Mathematics
, 2002
"... Trellis linearity, first considered by McEliece in 1996, turns out to be crucial in the study of tailbiting trellises. In this chapter, basic structural properties of linear trellises are investigated. A rigorous definition of linearity is given for both conventional and tailbiting trellises. ..."
Abstract

Cited by 16 (1 self)
 Add to MetaCart
(Show Context)
Trellis linearity, first considered by McEliece in 1996, turns out to be crucial in the study of tailbiting trellises. In this chapter, basic structural properties of linear trellises are investigated. A rigorous definition of linearity is given for both conventional and tailbiting trellises.