The Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm is an important channel decoding method. We extend it to trellis rate-distortion data compression. Beginning from source coding principles, the derivation of the algorithm...
详细信息
ISBN:
(纸本)0780391519
The Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm is an important channel decoding method. We extend it to trellis rate-distortion data compression. Beginning from source coding principles, the derivation of the algorithm avoids channel coding or soft output ideas. The encoder does not use entropy coding;equiprobable reproducer letters are emphasized since these maximize entropy. The BCJR method is demonstrated by tests of a tail-biting variant. It performs much better than the ordinary Viterbi algorithm for short and medium blocks. However, the improvement stems from tail biting;the role of the BCJR is to achieve tail biting in a relatively simple way. Some issues that arise with tail biting are explored. It is shown that there is an optimal trellis state size for each block length.
In this paper a new MIMO detector is proposed and its performance for 4/8PSK trellis coded signals is evaluated. As it is concluded from various simulations, this algorithm is not only efficient for coded signals but ...
详细信息
ISBN:
(纸本)0780377575
In this paper a new MIMO detector is proposed and its performance for 4/8PSK trellis coded signals is evaluated. As it is concluded from various simulations, this algorithm is not only efficient for coded signals but also obtains considerable improvement in achievable data rate.
The aim of this paper is to analyze and compare the performance of trellis coded Space Time Transmit Diversity (STTD) scheme and trellis coded Time Switched Transmit Diversity (TSTD) scheme for CDMA system. In the fir...
详细信息
ISBN:
(纸本)9780780393110
The aim of this paper is to analyze and compare the performance of trellis coded Space Time Transmit Diversity (STTD) scheme and trellis coded Time Switched Transmit Diversity (TSTD) scheme for CDMA system. In the first part of the paper we will derive an upper bound for the Frame Error Rate (FER) of both the schemes. We then use the expressions for the upper bound to present the design of trellis codes that are optimum in terms of FER. In the second part of the paper we provide numerical results that validate the design. We conclude with a comparison of both schemes under different channel conditions and multi-user interference.
In this paper, a high quality, and in many prospects, efficient, wavelet color image codec (WCIC) is introduced. This codec allows to achieve high compression ratios with little degradation in visual quality. WCIC sim...
详细信息
ISBN:
(纸本)0819422355
In this paper, a high quality, and in many prospects, efficient, wavelet color image codec (WCIC) is introduced. This codec allows to achieve high compression ratios with little degradation in visual quality. WCIC simultaneously exploits several characteristics of the wavelet transforms (multiresolution decompositions). Wavelet transform is formed using wavelet packets via lattice structures. Bit allocation algorithm is developed to distribute the bits between and in the colors such that minimal mean-squared-error (MSE) is introduced in each color component. This proves to be beneficial at low bit rates which keeps the color distribution in balance. The wavelet coefficients are quantized using either trellis or zero-tree quantizers depending on their statistics. Quantized coefficients are further compressed with adaptive arithmetic coding resulting in the final coded bit stream. This codec is applied to a wide range of images, from computer animations to natural pictures. The results are compared to other algorithms, including fractals and JPEG, and relative merits of the proposed algorithm are presented.
Parallel concatenated convolutional codes, turbo codes [1], are very attractive scheme at a point of view of an error probability performance. An bit error rate (BER) evaluation for turbo codes is done by a uniform in...
详细信息
Parallel concatenated convolutional codes, turbo codes [1], are very attractive scheme at a point of view of an error probability performance. An bit error rate (BER) evaluation for turbo codes is done by a uniform interleaver bound calculation [2] and/or a computer simulation. The former is calculated under the assumption of uniform interleaver, and is only effective for an BER evaluation with a pseudo random interleaver. The latter dose not have any interleaver restrictions. However, for a very low BER evaluation, it takes enormous simulation time. In this paper, a new error probability evaluation method for turbo codes is proposed. It is based on the error event simulation method [3]. For each evaluation for the predetermined error sequence, importance sampling, which is one of the fast simulation methods, is applied. To prove the effectiveness of the proposed method, numerical examples are shown. The proposed method well approximates the BER at the error floor region. Under the same accuracy, the IS estimation time at BER = 10(-7) is reduced to 1/(6358) of the ordinary Monte-Carlo simulation time.
In this paper we have analyze power efficiency of advanced modulation formats over Additive White Gaussian Noise (AWGN) channel. The advanced modulation formats are polarization division multiplexing quadrature phase ...
详细信息
ISBN:
(纸本)9789380544199
In this paper we have analyze power efficiency of advanced modulation formats over Additive White Gaussian Noise (AWGN) channel. The advanced modulation formats are polarization division multiplexing quadrature phase shift keying (PDM-QPSK), polarization switched quadrature phase shift keying (PS-QPSK) and six polarization quadrature phase shift keying (6P-QPSK) and these modulation formats are investigated with forward error correction channel coding like Turbo coding and trellis Coded Modulation channel coding schemes.
This paper derives the upper and lower bounds on the minimum distance of 4-ary circular trellis-coded modulation using a simplex signal constellation. The bounds are shown to be tight and reachable, and the code is sh...
详细信息
This paper derives the upper and lower bounds on the minimum distance of 4-ary circular trellis-coded modulation using a simplex signal constellation. The bounds are shown to be tight and reachable, and the code is shown to achieve simplex distance between parallel paths at each stage of the trellis. (C) 2002 Elsevier Science (USA).
In this paper, a new near optimum receiver for linear MIMO channels is proposed. The main structure of this receiver is based on estimation of spatial signature matrix and soft joint detection of received signal. In p...
详细信息
ISBN:
(纸本)0780375106
In this paper, a new near optimum receiver for linear MIMO channels is proposed. The main structure of this receiver is based on estimation of spatial signature matrix and soft joint detection of received signal. In proposed joint detector, by some modification on feedback structure of iterative joint detectors, the probability of convergence to local minima is decreased. From various simulations, it has been shown that the receiver is efficient for trellis MPSK coded signals. The computational complexity of channel estimator and soft joint detector has linear relationship with number of transmitter and receiver antennas and tracking speed of channel estimator is relatively enough. Therefore proposed receiver can be used in high bit rate wireless communication services.
Multi-Frequency Modulation has been the topic of several papers at NPS. In past systems the majority of time required for the generation of the MFM signal was due to the software routine used to implement the FFT. Xn ...
详细信息
Multi-Frequency Modulation has been the topic of several papers at NPS. In past systems the majority of time required for the generation of the MFM signal was due to the software routine used to implement the FFT. Xn this report a Digital Signal Processor was used to reduce the time needed to generate the FFT. The use of trellis coding and Viterbi decoding on a Digital Signal Processor was also investigated. Assembly language programs for three encoder/decoder systems were developed. The first uses a 16 QAM signal, the second uses a 2/3 rate convolutional encoder and Viterbi decoder and the third uses the V.32 convolutional encoder and a Viterbi decoder.
NASA Technical Reports Server (Ntrs) 19920005017: Flexible Digital Modulation and coding Synthesis for Satellite Communications by NASA Technical Reports Server (Ntrs); published by
NASA Technical Reports Server (Ntrs) 19920005017: Flexible Digital Modulation and coding Synthesis for Satellite Communications by NASA Technical Reports Server (Ntrs); published by
暂无评论