Optimizing the mapping of low-density parity check codes on parallel decoding architectures

Proceedings - International Conference on Information Technology: Coding and Computing, ITCC 2001

Volumn , Issue , 2001, Pages 578-586

  Al Rawi, Ghazi ^a   Cioffi, J ^a   Horowitz, M ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); COMPLEX NETWORKS; GENETIC ALGORITHMS; MAPPING; PARALLEL ARCHITECTURES; SATELLITE COMMUNICATION SYSTEMS; TOPOLOGY;

BI-DIRECTIONAL TORUS; CLUSTERING OPERATION; CLUSTERING TECHNIQUES; COMMUNICATION COST; LOW-DENSITY PARITY-CHECK (LDPC) CODES; MIN-CUT ALGORITHM; NUMBER OF CLUSTERS; SEARCH COMPLEXITY;

CLUSTERING ALGORITHMS;

EID: 84961789594     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITCC.2001.918859     Document Type: Conference Paper

References (14)

1. R. G. Gallager, "Low-Density Parity-Check Codes", IRE Trans. on Information Theory, Jan. 1962, pp. 21-28.
2. W. J. Dally, "Interconnect-limited VLSI architecture," IEEE Inter. Conf. on Interconnect Technology, May 1999, pp. 15-17.
3. G. Al-Rawi and John Cioffi, "A highly efficient domain programmable parallel architecture for LDPCC decoding", ITCC2001, Las Vegas, April 2001.
4. K. Kschischang, et al., "Factor graphs and the sum-product algorithm", submitted to IEEE Trans. on Information Theory, July 1998. Available on the web at: http://www.comm.utoronto.ca/frank/factor/
5. P. Sadayappan and Fikrel Ercal, "Cluster-partitioning approach to mapping parallel programs onto a hybercube", Int. Conf. on Supercomputing, Athens, June 1987, pp. 475-97.
6. B. Shirazi, B., et al. "Analysis and evaluation of heuristic methods for static task scheduling", Journal of Parallel and Distributed Computing, vol. 10, Nov. 1990, pp. 222-232.
7. B. W. Karnighan and S. Lin, "An efficient heuristic for partitioning graphs", Bell System Technical Journal, vol. 49, Feb. 1970, pp. 291-308.
8. J. H. Holland, "Adaptation in natural and artificial systems", Univ. of Michigan Press, Ann Arbor, Mich., 1975.
9. C. P. Ravikumar, et al., "Genetic algorithm for mapping tasks onto a reconfigurable parallel processor", IEE Proceedings-Computers and Digital Techniques, Mar. 1995, vol. 142, pp. 81-6.
10. M. J. Baxter, et al., "An investigation of the heterogeneous mapping problem using genetic algorithm", Int. Conf. on Control, Exeter, UK, Sep. 1996, pp. 448-53.
11. E-G. Talbi, et al., "Hill-climbing, simulated annealing and genetic algorithms: a comparative study and application to the mapping problem", Hawaii Int. Conf. on System Sciences, Jan. 1993, pp. 565-73.
12. M. Alaoui, et al., " A parallel genetic algorithm for task mapping on parallel machines" Symposium on Parallel and Distributed Processing, San Juan, Puerto Rico, Apr. 1999, pp. 201-9.
13. J. Baker, "Adaptive selection methods for genetic algorithms", Proc. of Genetic Algorithms and their Applications, 1985, pp. 101-111.
14. D. E. Goldberg, "Genetic algorithms in search, optimization and machine learning", Addison-Wesley, 1989.