نتایج جستجو برای: turbo

تعداد نتایج: 6296  

2006
Alexandre de Baynast Predrag Radosavljevic Victor Stolpman Joseph R. Cavallaro Ashutosh Sabharwal

The convergence rate of LDPC decoding is comparatively slower than turbo code decoding: 25 LDPC iterations versus 8-10 iterations for turbo codes. Recently, Mansour proposed a ‘turbo-schedule’ to improve the convergence rate of LDPC decoders. In this letter, we first extend the turbo-scheduling principle to the check messages. Second, we show analytically that the convergence rate of both turbo...

2000
J. Freudenberger M. Bossert

A new code construction namely woven turbo codes, is presented , which is a variation of woven convolutional codes. Parallel encoders (turbo codes 2]) can be considered as a special case of woven turbo encoders, where only one outer and inner encoder is used. However, woven turbo codes with a larger number of outer codes yield higher minimum distances than turbo codes with random permutations.

Journal: :IEICE Transactions 2007
Jeong Woo Lee Woo Suk Kwon

The reliability of a data communication can be improved by using an automatic repeat request (ARQ) protocol, in which the receiver requests the retransmission of data packets when an error is detected in the received data. The hybrid ARQ (HARQ) scheme combines an ARQ and an error correction coding [1]. Turbo codes proposed by Berrou et al. in 1993 [2] show an error correction capability approac...

Journal: :international journal of automotive engineering 0
e. safarian k. bilen m. akif ceviz a. salimias

the usage of turbochargers in diesel engines has led to the downsizing of the motors as well as usage of the waste gates in turbochargers. any dimensional reduction in turbochargers and appurtenant leads to an enhancement on the performance of internal combustion engines and in environmental problems in terms of aerodynamic, thermodynamic and mechanical specifications for both engines and turbo...

2010
Camille LEROUX Christophe JEGO Patrick ADDE Michel JEZEQUEL

—In this paper, we demonstrate the higher hardware ef ciency of Reed-Solomon (RS) parallel turbo decoding compared with BCH parallel turbo decoding. Based on an innovative architecture, this is the rst implementation of fully parallel RS turbo decoder. A performance analysis is performed showing that RS Block Turbo Codes (RS-BTC) have decoding performance equivalent to Bose Ray-Chaudhuri Hocque...

Journal: :IEEE Trans. Wireless Communications 2002
Bee Leong Yeap Tong-Hooi Liew J. Hamorsky Lajos Hanzo

Turbo equalizers have been shown to be successful in mitigating the effects of inter-symbol interference introduced by partial response modems and by dispersive channels for code rates of 1 2. In this contribution, we comparatively studied the performance of a range of binary phase-shift keying turbo equalizers employing block-turbo codes, namely Bose–Chaudhuri–Hocquenghen turbo codes, convolut...

2002
Naotake Yamamoto Tomoaki Ohtsuki

Infrared wireless communication and optical communication usually adopt on-off keying (OOK) and pulse position modulation (PPM). In [1] we presented the iterative maximum a posteriori probability (MAP) decoding of Turbo coded OOK and Turbo coded binary PPM (BPPM). In this paper, we present a soft-output Viterbi algorithm (SOVA) based iterative decoding of Turbo coded OOK and Turbo coded BPPM. W...

2012
Do-Hoon Kim Heung-Gyoon Ryu

Basically, conventional single-carrier system has an advantage in limited power communication systems. However, the performance of conventional single-carrier system is seriously degraded by ISI (inter-symbol interference). In order to overcome the ISI, communication systems are commonly used an equalizer. Turbo equalization technique was proposed to maximize system performance over ISI channel...

Journal: :IACR Cryptology ePrint Archive 2008
Vlastimil Klíma

In this paper we don't examine security of Turbo SHA-2 completely; we only show new collision attacks on it, with smaller complexity than it was considered by Turbo SHA-2 authors. In [1] they consider Turbo SHA-224/256r and Turbo SHA-384/512-r with variable number of rounds r from 1 to 8. The authors of [1] show collision attack on Turbo SHA-256-1 with one round which has the complexity of 2. F...

Journal: :IEICE Electronic Express 2006
K. Ramasamy Mohammad Umar Siddiqi Mohamad Yusoff Alias A. Arunagiri

Turbo code is recommended as a channel coding scheme, which has been shown to be capable of performing close to the Shannon Limit. In this paper, we compare the performance of both convolutional and block turbo codes over AWGN and Rayleigh fading channels. It is observed that the performance of convolutional turbo code is slightly better in the water fall region and the coding gain ranges from ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید