Results 151 to 160 of about 2,319 (194)

Rateless-coded hybrid ARQ

2007 6th International Conference on Information, Communications & Signal Processing, 2007
Recently, hybrid-ARQ attracts significant research efforts due to the emergence of high speed data packet access (HSDPA) standard. Turbo-coded hybrid-ARQ was reported to have very good performance under block fading channels. In this paper, we investigate new hybrid ARQ schemes using rateless codes.
null Chia-han Lee, Wen Gao
openaire   +1 more source

Rateless coding for wireless relay channels

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005., 2005
We propose a novel coding framework for wireless relay channels based on rateless codes, which allows for a natural extension to multiple antenna and multiple relay settings. The relaying protocol is half-duplex, and relays independently choose when to collaborate, if at all.
Jeff Castura, Yongyi Mao
openaire   +1 more source

Rateless Multilevel Coding and Applications

GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference, 2009
We propose a novel communication scheme that combines rateless transmission and multilevel coding (MLC). The scheme is able to attain a throughput that is equal to the constellation-constrained channel capacity. It is particularly useful in cases where the celebrated bit-interleaved coded modulation (BICM) would leave significant gaps to the channel ...
Trung Thanh Nguyen, Lutz Lampe
openaire   +1 more source

Rateless codes on noisy channels

International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings., 2004
This paper studies the performance of two classes of rateless codes (LTand Raptor codes) on noisy channels such as the BSC and the AWGNC. We find that Raptor codes outperform LT codes, and have good performance on a wide variety of noisy channels.
R. Palanki, J.S. Yedidia
openaire   +1 more source

Rateless Codes Based on Punctured Polar Codes

2018 15th International Symposium on Wireless Communication Systems (ISWCS), 2018
Polar codes are the first binary linear block codes provably achieving the symmetric capacity of arbitrary binary-input discrete memoryless channels. However, in their original design, their block length is limited to integer powers of two, a constraint that may be relaxed by puncturing.
Christopher Schnelling, Markus Rothe, Rudolf Mathar, Anke Schmeink   +3 more
openaire   +1 more source

Rateless coding over fading channels

IEEE Communications Letters, 2006
We propose a framework for communication over fading channels utilizing rateless codes. An implementation using fountain codes is simulated, demonstrating that such a scheme has advantages in efficiency, reliability and robustness over conventional fixed-rate codes, particularly when channel state information is not available at the transmitter.
J. Castura, null Yongyi Mao
openaire   +1 more source

Error Correction for Rateless Codes

2009 IEEE 13th Digital Signal Processing Workshop and 5th IEEE Signal Processing Education Workshop, 2009
Rateless codes for erasure channels were recently proposed by Luby with very efficient coding and decoding schemes. However, designing an efficient decoding rateless code for Binary Error Channel (BEC), still remains a difficult problem. In this work we propose a rateless decoding algorithm for the BEC using a coding matrix G with a high level of ...
Bruno Jesus, Jose M. N. Vieira, Paulo J. S. G. Ferreira   +2 more
openaire   +1 more source

Rateless Coding and Relay Networks

IEEE Signal Processing Magazine, 2007
A framework for coding over relay channels using rateless codes is the intersection of two active areas of research in communications; namely relay networks and rateless coding. We demonstrate that there is a very natural and useful fit between these two areas and describe some design challenges and implementation considerations for this framework. The
Jeff Castura, Yongyi Mao
openaire   +1 more source

Rateless Codes for MIMO Channels

IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference, 2008
Two rateless code constructions are developed for efficient communication over multi-input multi-output (MIMO) Gaussian channels. The key ingredients in both architectures are layering, dithering, and repetition. Both employ successive cancellation decoding along with minimum mean-square error (MMSE) combining and convert the MIMO channel into a scalar
Maryam Modir Shanechi, Uri Erez, Gregory W. Wornell   +2 more
openaire   +1 more source

Non-coded rateless multiple access

2012 International Conference on Wireless Communications and Signal Processing (WCSP), 2012
We present a novel random multiple access scheme called non-coded rateless multiple access (NC-RMA), in which each user keeps on sending its non-coded data packet with a predetermined probability at each time slot, until the receiver retrieves the data packet from a potentially infinite number of possibly collided packets.
Zhaoyang Zhang, Shaolei Chen, Kedi Wu
openaire   +1 more source