A Generalization of the Blahut–Arimoto Algorithm to Finite-State Channels Conferences

authors

• Vontobel, Pascal O
• Kavcic, Aleksandar
• Arnold, Donald
• Loeliger, Hans-Andrea

status

• published 

publication date

• May 2008

has subject area

• 0801 Artificial Intelligence and Image Processing (FoR)
• 0906 Electrical and Electronic Engineering (FoR)
• 1005 Communications Technologies (FoR)
• Networking & Telecommunications (Science Metrix)

published in

• IEEE Transactions on Information Theory  Journal

presented at event

• IEEE International Symposium on Information Theory  Conference

keywords

• BINARY
• Blahut-Arimoto algorithm (BAA)
• CAPACITY
• CODES
• COMPUTATION
• Computer Science
• Computer Science, Information Systems
• Engineering
• Engineering, Electrical & Electronic
• GRAPHS
• INFORMATION RATES
• INTERSYMBOL INTERFERENCE
• PRODUCT
• Science & Technology
• Technology
• capacity
• constrained capacity
• finite-state machine channels (FSMCs)
• finite-state machine sources (FSMSs)
• information rate
• optimization
• run-length constraints

Digital Object Identifier (DOI)

• 10.1109/tit.2008.920243

start page

• 1887

end page

• 1918

volume

• 54

issue

• 5