Results 231 to 240 of about 21,126 (276)
Some of the next articles are maybe not open access.
IEEE Transactions on Communications, 2005
In this paper, we introduce the concept of nonsystematic turbo codes and compare them with classical systematic turbo codes. Nonsystematic turbo codes can achieve lower error floors than systematic turbo codes because of their superior effective free distance properties.
Adrish Banerjee +3 more
openaire +2 more sources
In this paper, we introduce the concept of nonsystematic turbo codes and compare them with classical systematic turbo codes. Nonsystematic turbo codes can achieve lower error floors than systematic turbo codes because of their superior effective free distance properties.
Adrish Banerjee +3 more
openaire +2 more sources
Proceedings. International Symposium on Information Theory, 2005. ISIT 2005., 2005
In this paper we introduce a new coding scheme - so-called laminated turbo codes. It is characterized by a block-convolutional structure that enables us to combine the advantages of a convolutional encoder memory and a block-oriented decoding method. We show that this block-convolutional structure is superior in terms of its error correction capability
Huebner, A. +3 more
openaire +2 more sources
In this paper we introduce a new coding scheme - so-called laminated turbo codes. It is characterized by a block-convolutional structure that enables us to combine the advantages of a convolutional encoder memory and a block-oriented decoding method. We show that this block-convolutional structure is superior in terms of its error correction capability
Huebner, A. +3 more
openaire +2 more sources
2010
This book is devoted to one of the essential functions of modern telecommunications systems: channel coding or error correction coding. Its main topic is iteratively decoded algebraic codes, convolutional codes and concatenated codes.
Berrou, Claude +17 more
openaire +3 more sources
This book is devoted to one of the essential functions of modern telecommunications systems: channel coding or error correction coding. Its main topic is iteratively decoded algebraic codes, convolutional codes and concatenated codes.
Berrou, Claude +17 more
openaire +3 more sources
IEEE Transactions on Communications, 2001
Summary: 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 ...
openaire +2 more sources
Summary: 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 ...
openaire +2 more sources
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