Gallager codes for CDMA applications. II. Implementations, complexity, and system capacity
- 1 January 2000
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 48 (11) , 1818-1828
- https://doi.org/10.1109/26.886472
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Design of provably good low-density parity check codesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Factor graphs and the sum-product algorithmIEEE Transactions on Information Theory, 2001
- Good error-correcting codes based on very sparse matricesIEEE Transactions on Information Theory, 1999
- An intuitive justification and a simplified implementation of the MAP decoder for convolutional codesIEEE Journal on Selected Areas in Communications, 1998
- Performance of low-rate orthogonal convolutional codes in DS-CDMA applicationsIEEE Transactions on Vehicular Technology, 1997
- Comparison of turbo-code decoders applied to short frame transmission systemsIEEE Journal on Selected Areas in Communications, 1996
- Reduced complexity symbol detectors with parallel structure for ISI channelsIEEE Transactions on Communications, 1994
- A tutorial on hidden Markov models and selected applications in speech recognitionProceedings of the IEEE, 1989
- An optimum symbol-by-symbol decoding rule for linear codesIEEE Transactions on Information Theory, 1976
- Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)IEEE Transactions on Information Theory, 1974