Sciweavers

28 search results - page 6 / 6
» Low complexity design of space-time convolutional codes with...
Sort
View
VLSISP
2010
140views more  VLSISP 2010»
13 years 6 months ago
A Split-Decoding Message Passing Algorithm for Low Density Parity Check Decoders
A Split decoding algorithm is proposed which divides each row of the parity check matrix into two or multiple nearly-independent simplified partitions. The proposed method signific...
Tinoosh Mohsenin, Bevan M. Baas
CORR
2010
Springer
105views Education» more  CORR 2010»
13 years 2 months ago
Universal and Robust Distributed Network Codes
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
Tracey Ho, Sidharth Jaggi, Svitlana Vyetrenko, Lin...
TIT
2010
143views Education» more  TIT 2010»
13 years 2 months ago
Asynchronous CDMA systems with random spreading-part I: fundamental limits
Spectral efficiency for asynchronous code division multiple access (CDMA) with random spreading is calculated in the large system limit. We allow for arbitrary chip waveforms and ...
Laura Cottatellucci, Ralf R. Müller, Mé...