Results 241 to 250 of about 11,614 (280)
Some of the next articles are maybe not open access.
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 +1 more source
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 +1 more source
Turbo multiuser detection for turbo-coded CDMA
WCNC. 1999 IEEE Wireless Communications and Networking Conference (Cat. No.99TH8466), 2003An iterative receiver structure is proposed for decoding multiuser information data in a turbo-coded DS-CDMA system. The receiver performs two successive soft-output decisions, achieved by a soft-input soft-output (SISO) multiuser detector and a bank of single-user SISO channel decoders, through an iterative process.
Xiaodong Wang 0001, H. Vincent Poor
openaire +1 more source
Code-matched interleaver for turbo codes
2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733), 2004In this paper, we research the code-matched interleaver's application condition and design method for turbo codes. The innovation is that firstly we give the parameters according to which we devise the code-matched interleavers combined with different generator matrix.
Xilin Zhang, Dongfeng Yuan, Ji Luo
openaire +1 more source
Code detection in turbo source coding
IEEE Communications Letters, 2006We consider the lossless compression of binary memoryless sources using a library of turbo codes. The message is compressed by each code and the best result along with the index of the applied code is sent to the decoder. Instead of transmitting the code index, we find a criterion to detect the code index using the transmitted parities.
Javad Haghighat +2 more
openaire +1 more source
Iterative MAP decoding of turbo coded OOK and turbo coded BPPM
GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270), 2002Infrared wireless communication and optical communication usually adopt on-off keying (OOK) and pulse position modulation (PPM). In this paper, we present iterative maximum a posteriori probability (MAP) decoding of Turbo coded OOK and Turbo coded binary PPM (BPPM).
Naotake Yamamoto, Tomoaki Ohtsuki
openaire +1 more source
Turbo Codes and Turbo Equalization
2000Turbo codes, introduced by Berrou, et al.[Berrou et al., 1993] in 1993, provide large coding gain for the memoryless additive white Gaussian noise (AWGN) channel and bring the system performance to within 1 dB from the Shannon capacity limit [Shannon, 1948]. The superior performance soon caused turbo codes to receive intense study.
openaire +1 more source
Improved Low Complexity Hybrid Turbo Code: A Modified Turbo Code
2009 Second International Conference on Emerging Trends in Engineering & Technology, 2009Turbo 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 ...
Archana Bhise, Prakash D. Vyavahare
openaire +1 more source
Aspects of interleaving for turbo codes
2013 International Conference on ICT Convergence (ICTC), 2013In this letter, we present some aspects of bit interleaving schemes applicable for turbo codes with block and convolutional codes as their component codes. A bit interleaving scheme across inter-codewords can be used to increase the performance of the codes when a block of correlated channel information exits in a codeword.
Saleem Ahmed +4 more
openaire +1 more source

