517 research outputs found
Turbo Decoding and Detection for Wireless Applications
A historical perspective of turbo coding and turbo transceivers inspired by the generic turbo principles is provided, as it evolved from Shannonâs visionary predictions. More specifically, we commence by discussing the turbo principles, which have been shown to be capable of performing close to Shannonâs capacity limit. We continue by reviewing the classic maximum a posteriori probability decoder. These discussions are followed by studying the effect of a range of system parameters in a systematic fashion, in order to gauge their performance ramifications. In the second part of this treatise, we focus our attention on the family of iterative receivers designed for wireless communication systems, which were partly inspired by the invention of turbo codes. More specifically, the family of iteratively detected joint coding and modulation schemes, turbo equalization, concatenated spacetime and channel coding arrangements, as well as multi-user detection and three-stage multimedia systems are highlighted
VLSI Architectures for WIMAX Channel Decoders
This chapter describes the main architectures proposed in the literature to
implement the channel decoders required by the WiMax standard, namely
convolutional codes, turbo codes (both block and convolutional) and LDPC. Then
it shows a complete design of a convolutional turbo code encoder/decoder system
for WiMax.Comment: To appear in the book "WIMAX, New Developments", M. Upena, D. Dalal,
Y. Kosta (Ed.), ISBN978-953-7619-53-
Deep Ensemble of Weighted Viterbi Decoders for Tail-Biting Convolutional Codes
Tail-biting convolutional codes extend the classical zero-termination
convolutional codes: Both encoding schemes force the equality of start and end
states, but under the tail-biting each state is a valid termination. This paper
proposes a machine-learning approach to improve the state-of-the-art decoding
of tail-biting codes, focusing on the widely employed short length regime as in
the LTE standard. This standard also includes a CRC code.
First, we parameterize the circular Viterbi algorithm, a baseline decoder
that exploits the circular nature of the underlying trellis. An ensemble
combines multiple such weighted decoders, each decoder specializes in decoding
words from a specific region of the channel words' distribution. A region
corresponds to a subset of termination states; the ensemble covers the entire
states space. A non-learnable gating satisfies two goals: it filters easily
decoded words and mitigates the overhead of executing multiple weighted
decoders. The CRC criterion is employed to choose only a subset of experts for
decoding purpose. Our method achieves FER improvement of up to 0.75dB over the
CVA in the waterfall region for multiple code lengths, adding negligible
computational complexity compared to the circular Viterbi algorithm in high
SNRs
Sequence codes
VĂŠase documento adjunt
Iterative multiuser detection with integrated channel estimation for turbo coded DS-CDMA.
In present days the demand of high bandwidth and data rate in wireless communications is increasing rapidly to accommodate multimedia applications, including services such as wireless video and high-speed Internet access. In this thesis, we propose a receiver algorithm for mobile communications systems which apply CDMA (Code division multiple access) as multiple access technique. Multiuser Detection and turbo coding are the two most powerful techniques for enhancing the performance of future wireless services. The standardization of direct sequence CDMA (DS-CDMA) systems in the third generation of mobile communication system has raised the interest in exploiting the capabilities and capacity of this type of Technology. However the conventional DS-CDMA system has the major drawback of multiple Access Interference (MAI). The MAI is unavoidable because receivers deal with the information which is transmitted not by a single information source but by several uncoordinated and geographically separated sources. To overcome this problem MUD is a promising approach to increase capacity. (Abstract shortened by UMI.)Dept. of Electrical and Computer Engineering. Paper copy at Leddy Library: Theses & Major Papers - Basement, West Bldg. / Call Number: Thesis2005 .C465. Source: Masters Abstracts International, Volume: 45-01, page: 0404. Thesis (M.Sc.)--University of Windsor (Canada), 2005
Reconfigurable Turbo/Viterbi Channel Decoder in the Coarse-Grained Montium Architecture
Mobile wireless communication systems become multi-mode systems. These future mobile systems employ multiple wireless communication standards, which are different by means of algorithms that are used to implement the baseband processing and the channel decoding. Efficient implementation of multiple wireless standards in mobile terminals requires energy-efficient and flexible hardware. We propose to implement both the baseband processing and channel decoding in a heterogeneous reconfigurable system-on-chip. The system-on-chip contains many processing elements of different granularities, which includes our coarse-grained reconfigurable MONTIUM architecture. We already showed the feasibility to implement the baseband processing of OFDM and WCDMA based communication systems in the MONTIUM. In this paper we implemented two kinds of channel decoders in the same MONTIUM architecture: Viterbi and Turbo decoding
- âŚ