Sciweavers

251 search results - page 21 / 51
» Channel Coding: The Road to Channel Capacity
Sort
View
CORR
2004
Springer
115views Education» more  CORR 2004»
14 years 11 months ago
Bounds on the decoding complexity of punctured codes on graphs
We present two sequences of ensembles of non-systematic irregular repeat-accumulate codes which asymptotically (as their block length tends to infinity) achieve capacity on the bi...
Henry D. Pfister, Igal Sason, Rüdiger L. Urba...
TWC
2008
136views more  TWC 2008»
14 years 11 months ago
On Antijamming in General CDMA Systems-Part II: Antijamming Performance of Coded Multicarrier Frequency-Hopping Spread Spectrum
In the first part of the paper, the capacity of a general multiuser code division multiple access (CDMA) jamming channel was analyzed for noncooperative and cooperative users in up...
Reza Nikjah, Norman C. Beaulieu
CORR
2010
Springer
103views Education» more  CORR 2010»
14 years 9 months ago
Least Squares Superposition Codes of Moderate Dictionary Size, Reliable at Rates up to Capacity
Sparse superposition codes are developed for the additive white Gaussian noise channel with average codeword power constraint. Codewords are linear combinations of subsets of vecto...
Andrew R. Barron, Antony Joseph
ICC
2007
IEEE
15 years 3 months ago
CS-CDMA/CP with M-ZCZ Codes Over a Multipath Fading Channel with Excess Spreads
Convolutional spreading CDMA with cyclic prefix (CS-CDMA/CP) enables multiuser interference-free (MUI-free) transmission over multipath channels with the use of zero correlation zo...
Nalin S. Weerasinghe, Takeshi Hashimoto
TWC
2010
14 years 6 months ago
Rateless coding for hybrid free-space optical and radio-frequency communication
Abstract--Free-space optical (FSO) transmission systems enable high-speed communication with relatively small deployment costs. However, FSO suffers a critical disadvantage, namely...
Ali AbdulHussein, Anand Oka, Trung Thanh Nguyen 00...