Results 71 to 80 of about 210 (96)
Serially Concatenated IRA Codes
, 2007 We address the error floor problem of low-density parity check (LDPC) codes on the binary-input additive white Gaussian noise (AWGN) channel, by constructing a serially concatenated code consisting of two systematic irregular repeat accumulate (IRA) component codes connected by an interleaver.
Cheng, Taikun +2 more
openaire +2 more sources
An Efficient Differential MIMO-OFDM Scheme with Coordinate Interleaving
EURASIP Journal on Wireless Communications and Networking, 2008 We propose a concatenated trellis code (TC) and coordinate interleaved differential space-time block code (STBC) for OFDM. The coordinate interleaver, provides signal space diversity and improves the codeword error rate (CER) performance of the system in
Aksoy Kenan, Aygölü Ümit
doaj
Concatenated codes for block-fading channels
, 2004 In this thesis we study coding strategies for single-user block-fading channels. The block-fading channel is a simplified model of slowly varying wireless communication channels with stringent delay constraints. This model is particularly important in practical applications where communication spans a finite number of degrees of freedom of the channel.
openaire +4 more sources
Journal of Communications Software and Systems, 2009 Multiple Serially-Concatenated Multiple-Parity-Check (M-SC-MPC) codes are a class of structured Low-Density Parity-Check (LDPC) codes, characterized by very simple encoding, that we have recently introduced.
Marco Baldi +3 more
doaj
Decoding of concatenated codes with interleaved outer codes
, 2004 Recently Bleichenbacher et al. proposed a decoding algorithm for interleaved Reed/Solomon codes, which allows close to errors to be corrected in many cases. We discuss the application of this decoding algorithm to concatenated codes.
Justesen, Jørn +2 more
openaire +2 more sources
Concatenated multilevel coding [PDF]
[Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications, 2003 The authors study different strategies for decoding the concatenated inner code, applied in the case of multilevel coding with a multistage decoding procedure. The first strategy recapitulates the classical method of decoding the concatenated code. The second strategy is based on an erasing technique using hard detection.
Antoine Chouly, Khaled Fazel
openaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
2010 The 2nd International Conference on Computer and Automation Engineering (ICCAE), 2010
This paper, studies the comparative performance of a traditional and Concatenated coding schemes for transmission of digital data over a mobile communication channel. Traditional codes are effective for reliable transmission of information over hostile channel when the errors caused by the channel are statistically independent.
Yousef Hwegi, Mahmod Osman, Nasser Ali
openaire +2 more sources
This paper, studies the comparative performance of a traditional and Concatenated coding schemes for transmission of digital data over a mobile communication channel. Traditional codes are effective for reliable transmission of information over hostile channel when the errors caused by the channel are statistically independent.
Yousef Hwegi, Mahmod Osman, Nasser Ali
openaire +2 more sources
Discrete Mathematics, Algorithms and Applications, 2020
Concatenated codes introduced by Forney in 1966 received wide attention due to their extensive usage in space missions. Thereafter, many concatenated codes were constructed on the similar lines and successfully employed in digital communication setup. In this paper, concatenated kernel code is defined.
R. Selvakumar, C. Pavan Kumar
openaire +2 more sources
Concatenated codes introduced by Forney in 1966 received wide attention due to their extensive usage in space missions. Thereafter, many concatenated codes were constructed on the similar lines and successfully employed in digital communication setup. In this paper, concatenated kernel code is defined.
R. Selvakumar, C. Pavan Kumar
openaire +2 more sources
IEEE Communications Letters, 1999
This letter presents a new construction of frequency-hopping (FH) patterns, here designated as concatenated prime codes, for a multilevel frequency-shift-keying/frequency-hopping code-division multiple-access (MFSK/FH-CDMA) system. The concatenated prime codes are constructed by modifying prime codes and they possess ideal autocorrelation and nearly ...
Hong, C.F., Yang, G.C.
openaire +2 more sources
This letter presents a new construction of frequency-hopping (FH) patterns, here designated as concatenated prime codes, for a multilevel frequency-shift-keying/frequency-hopping code-division multiple-access (MFSK/FH-CDMA) system. The concatenated prime codes are constructed by modifying prime codes and they possess ideal autocorrelation and nearly ...
Hong, C.F., Yang, G.C.
openaire +2 more sources
2009 IEEE International Symposium on Information Theory, 2009
This paper investigates fountain communication over discrete-time memoryless channels. Fountain error exponent achievable by linear complexity concatenated fountain codes is derived.
Jie Luo, Zheng Wang
openaire +2 more sources
This paper investigates fountain communication over discrete-time memoryless channels. Fountain error exponent achievable by linear complexity concatenated fountain codes is derived.
Jie Luo, Zheng Wang
openaire +2 more sources