Results 321 to 330 of about 2,501,833 (347)

VLSI design and implementation of low-complexity adaptive turbo-code encoder and decoder for wireless mobile communication applications

1998 IEEE Workshop on Signal Processing Systems. SIPS 98. Design and Implementation (Cat. No.98TH8374), 1998
A low-complexity multi-stage pipeline turbo-code encoder and decoder architecture for wireless mobile communication applications is presented. The VLSI decoder architecture presented in this paper avoids complex operations such as exponent and ...
S. Hong, J. Yi, W. Stark
semanticscholar   +1 more source

On the performance of turbo codes [PDF]

IEEE Military Communications Conference. Proceedings. MILCOM 98 (Cat. No.98CH36201), 2002
The performance of the turbo code is sensitive to its code structure, which is made up of code rate, constraint length, tap connection, block size, interleaving pattern and number of decoding iterations. In this paper, mitigation techniques that can lower the error floor are adopted in both encoder and decoder.
openaire   +1 more source

Low power soft output Viterbi decoder scheme for turbo code decoding

Proceedings of 1997 IEEE International Symposium on Circuits and Systems. Circuits and Systems in the Information Age ISCAS '97, 1997
Turbo codes, which are new forward error-correcting codes (FEC), represent a prospective coding scheme for future wireless communication. In this paper, we propose two schemes to reduce the power consumption of the register-exchange soft output Viterbi ...
Lang Lin, Chi-Ying Tsui, Roger S. Cheng
semanticscholar   +1 more source

On turbo code decoder performance in optical-fiber communication systems with dominating ASE noise

, 2003
In this paper, we study the effects of different ASE noise models on the performance of turbo code (TC) decoders. A soft-decoding algorithm, the Bahl, Cocke, Jelinek, and Raviv (BCJR) decoding algorithm, is generally used in TC decoders.
Yi Cai, J. M. Morris, T. Adalı, C. Menyuk   +3 more
semanticscholar   +1 more source

The all-zero iterative decoding algorithm for turbo code minimum distance computation

IEEE International Conference on Communications, 2004
An efficient algorithm for turbo code minimum distance computation is essential for estimating their performance in the error floor region without resorting to long simulations. Recently, Berrou et al.
R. Garello, A. Casado
semanticscholar   +1 more source

Turbo-SPC codes

IEEE Transactions on Communications, 2001
This letter is concerned with a family of modified turbo-type codes, referred to as turbo-SPC (single parity check) codes. A technique based on the SPC code is introduced to replace puncturing for rate adjustment. A noticeable feature of the proposed scheme is the significantly reduced decoding complexity compared with the standard punctured turbo code.
openaire   +2 more sources

Turbo coded BLAST

Proceedings of the IEEE Information Theory Workshop, 2003
In this paper we investigate turbo coding for BLAST (Bell Labs layered space-time) by encoding single user data streams and transmitting the symbols in different antennas. At the receiver we adopt an MMSE nulling, incremental decoding and soft cancellation approach to decode the symbols.
openaire   +2 more sources

Reducing power consumption of turbo code decoder using adaptive iteration with variable supply voltage

Proceedings / International Symposium on Low Power Electronics and Design, 1999
Turbo code becomes popular for the next generation wireless communication systems because of its remarkable coding performance. One of the problems for decoding turbo code in the receiver is the complexity and the high power consumption since multiple ...
Oliver Yuk-Hang Leung, Chung-Wai Yue, C. Tsui, R. Cheng   +3 more
semanticscholar   +1 more source

Performance Comparison of Punctured Turbo Codes and Multi Binary Turbo Codes

2007 International Symposium on Signals, Circuits and Systems, 2007
In this paper we analyze the performance of punctured turbo codes (TCs) and punctured multi binary turbo codes (MBTCs) over additive white Gaussian noise (AWGN) channel in terms of Bit Error Rate (BER) and Frame Error Rate (FER). We consider the original TCs that consist of the parallel concatenation of two identical rate 1/2 recursive systematic ...
M.M. Nafornita, Horia Balta, Maria Kovaci, A. de Baynast   +3 more
openaire   +2 more sources

Improved Low Complexity Hybrid Turbo Code: A Modified Turbo Code

2009 Second International Conference on Emerging Trends in Engineering & Technology, 2009
Turbo Convolutional Codes (TCC) are excellent error correcting codes as they show near Shannon capacity performance in communication systems. However, Turbo decoders are computationally complex. Recently, a class of modified Turbo codes called Low Complexity Hybrid Turbo Codes (LCHTC) is proposed with Bit Error Rate (BER) which is almost same as that ...
Prakash D. Vyavahare, Archana Bhise
openaire   +2 more sources