DocumentCode
3059031
Title
Generalized belief propagation algorithm for the capacity of multi-dimensional run-length limited constraints
Author
Sabato, Giovanni ; Molkaraie, Mehdi
Author_Institution
PARALLEL Inf. AG, Luzern, Switzerland
fYear
2010
fDate
13-18 June 2010
Firstpage
1213
Lastpage
1217
Abstract
The performance of the generalized belief propagation algorithm for computing the noiseless capacity of finite-sized two-dimensional and three-dimensional run-length limited constraints is investigated. For each constraint, a method is proposed to choose a set of clusters. Simulation results for different sizes of channels with different constraints are reported. Convergence to the Shannon capacity is also discussed.
Keywords
channel capacity; convergence of numerical methods; runlength codes; Shannon channel capacity; convergence; generalized belief propagation algorithm; multidimensional runlength limited constraints; noiseless capacity; Belief propagation; Clustering algorithms; Computational modeling; Convergence; Holography; Information rates; Interference constraints; Memory; Optical recording; Timing;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on
Conference_Location
Austin, TX
Print_ISBN
978-1-4244-7890-3
Electronic_ISBN
978-1-4244-7891-0
Type
conf
DOI
10.1109/ISIT.2010.5513231
Filename
5513231
Link To Document