286 research outputs found
Punctured Trellis-Coded Modulation
In classic trellis-coded modulation (TCM) signal constellations of twice the
cardinality are applied when compared to an uncoded transmission enabling
transmission of one bit of redundancy per PAM-symbol, i.e., rates of
when denotes the cardinality of the signal
constellation. In order to support different rates, multi-dimensional (i.e.,
-dimensional) constellations had been proposed by means of
combining subsequent one- or two-dimensional modulation steps, resulting in
TCM-schemes with bit redundancy per real dimension. In
contrast, in this paper we propose to perform rate adjustment for TCM by means
of puncturing the convolutional code (CC) on which a TCM-scheme is based on. It
is shown, that due to the nontrivial mapping of the output symbols of the CC to
signal points in the case of puncturing, a modification of the corresponding
Viterbi-decoder algorithm and an optimization of the CC and the puncturing
scheme are necessary.Comment: 5 pages, 10 figures, submitted to IEEE International Symposium on
Information Theory 2013 (ISIT
On decoding of multi-level MPSK modulation codes
The decoding problem of multi-level block modulation codes is investigated. The hardware design of soft-decision Viterbi decoder for some short length 8-PSK block modulation codes is presented. An effective way to reduce the hardware complexity of the decoder by reducing the branch metric and path metric, using a non-uniform floating-point to integer mapping scheme, is proposed and discussed. The simulation results of the design are presented. The multi-stage decoding (MSD) of multi-level modulation codes is also investigated. The cases of soft-decision and hard-decision MSD are considered and their performance are evaluated for several codes of different lengths and different minimum squared Euclidean distances. It is shown that the soft-decision MSD reduces the decoding complexity drastically and it is suboptimum. The hard-decision MSD further simplifies the decoding while still maintaining a reasonable coding gain over the uncoded system, if the component codes are chosen properly. Finally, some basic 3-level 8-PSK modulation codes using BCH codes as component codes are constructed and their coding gains are found for hard decision multistage decoding
Joint space-time trellis decoding and channel estimation in correlated fading channels
Copyright © 2004 IEEEThis letter addresses the issue of joint space-time trellis decoding and channel estimation in time-varying fading channels that are spatially and temporally correlated. A recursive space-time receiver which incorporates per-survivor processing (PSP) and Kalman filtering into the Viterbi algorithm is proposed. This approach generalizes existing work to the correlated fading channel case. The channel time-evolution is modeled by a multichannel autoregressive process, and a bank of Kalman filters is used to track the channel variations. Computer simulation results show that a performance close to the maximum likelihood receiver with perfect channel state information (CSI) can be obtained. The effects of the spatial correlation on the performance of a receiver that assumes independent fading channels are examined.Van Khanh Nguyen and Langford B. Whit
Cyclic redundancy check-based detection algorithms for automatic identification system signals received by satellite.
This paper addresses the problem of demodulating signals transmitted in the automatic identification system. The main characteristics of such signals consist of two points: (i) they are modulated using a trellis-coded modulation, more precisely a Gaussian minimum shift keying modulation; and (ii) they are submitted to a bit stuffing procedure, which makes more difficult the detection of the transmitted information bits. This paper presents several demodulation algorithms developed in different contexts: mono-user and multi-user transmissions, and known/unknown phase shift. The proposed receiver uses the cyclic redundancy check (CRC) present in the automatic identification system signals for error correction and not for error detection only. By using this CRC, a particular Viterbi algorithm, on the basis of a so-called extended trellis, is developed. This trellis is defined by extended states composed of a trellis code state and a CRC state. Moreover, specific conditional transitions are defined to take into account the possible presence of stuffing bits. The algorithms proposed in the multi-user scenario present a small increase of computation complexity with respect to the mono-user algorithms. Some performance results are presented for several scenarios in the context of the automatic identification system and compared with those of existing techniques developed in similar scenarios
Method and apparatus for implementing a maximum-likelihood decoder in a hypercube network
A method and a structure to implement maximum-likelihood decoding of convolutional codes on a network of microprocessors interconnected as an n-dimensional cube (hypercube). By proper reordering of states in the decoder, only communication between adjacent processors is required. Faster and more efficient operation is enabled, and decoding of large constraint length codes is feasible using standard VLSI technology
ROBUST ITERATIVEPRUNED-TREE DETECTION ANDLDPCC DECODING
A novel sub-optimal low-complexity equalization and turbo-iterative decoding scheme based on running the sum-product algorithm on an aggressively pruned tree is proposed in this paper for use in a multiple transmit and receive antenna (MIMO) system operating over severe frequency-selective fading inter-symbol interference (ISI) channels. The receiver deals with the issue of signal processing complexity which with a full-search equalization grows with power-law. The sum-product algorithm is applied to the pruned tree which is constructed by two main operations, a sphere list detection and a threshold-based tree search algorithms. At a particular node of the tree, only a number of most probable branches in the tree of hypothetical symbols are expanded and included in the list of candidates; at a particular tree-section, all but some of most probable candidatesare pruned. This pruned tree takes the soft input and generates the soft output, and is utilized in the turbo-iterative manner with the decoder of the low-density parity check code. We oobtained the approximated error probability using the pair-wise error calculation averaged over the fading ensemble, and use it to boundour simulation results. Our current simulation results are obtained for MIMO systems up to four transmit and four receive antennas, using 4-QAM symbols. They indicate the proposed receiverperforms extremely well. The proposed transceiver system is ideal for a system of higher spectral efficiency with even larger signal constellations. Adopting Hassbi-Vikalo's framework, we provide a method which enables a quick evaluation of the signal processing complexity required in the proposed algorithm at a given set of system parameters
- âŠ