Interior point decoding for linear vector channels based on convex optimization

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2008, Pages 1493-1497

  Wadayama, Tadashi ^a  

^a NAGOYA INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CONVEX OPTIMIZATION; CONVEX OPTIMIZATION PROBLEMS; DECODING ALGORITHMS; GRADIENT DESCENT; INTER-SYMBOL INTERFERENCES; INTERIOR POINT; INTERNATIONAL SYMPOSIUM; LOW DENSITY PARITY; MAXIMUM LIKELIHOOD DECODING; MI MO CHANNELS; NEWTON METHODS; PARTIAL-RESPONSE CHANNELS; VARIATIONS OF; VECTOR CHANNELS;

CODES (SYMBOLS); CYBERNETICS; GRADIENT METHODS; INFORMATION THEORY; MIM DEVICES; NEWTON-RAPHSON METHOD; OPTIMIZATION; TECHNICAL PRESENTATIONS; VECTORS; WIRELESS LOCAL AREA NETWORKS (WLAN);

DECODING;

EID: 52349089365     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2008.4595236     Document Type: Conference Paper

References (5)

1. J. Feldman, Decoding error-correcting codes via linear programming, Massachusetts Institute of Technology, Ph. D. thesis, 2003.
2. R. Koetter and P.O. Vontobel, "Graph-covers and iterative decoding of LDPC codes," Proceedings of International Symposium on Turbo codes, 2003.
3. S. Boyd and L. Vandenberghe. "Convex optimization," Cambridge University Press, 2004.
4. M.H. Taghavi and P.H. Siegel, "Equalization on graphs: linear programming and message passing," Proceedings of International Symposium on Information Theory. Nice, 2007.
5. D.J.C. MacKay, "Encyclopedia of sparse graph codes," http://www.inference.phy.cam.ac.uk/mackay/codes/data.html