A GEOMETRIC PROGRAMMING APPROACH TO THE CHANNEL CAPACITY PROBLEM

A duality relationship for the capacity of discrete memoryless channels is studied by means of geometric programming duality theory. A compulationally attractive dual approach and a family of algorithms which includes the classic Arimoto-Blahut method is proposed for the computation of capacity,

Saved in:
Bibliographic Details
Published in:Engineering optimization 1992-04, Vol.19 (2), p.115-130
Main Authors: KLAFSZKY, EMIL, MAYER, JÁNOS, TERLAKY, TAMÁS
Format: Article
Language:English
Subjects:
Applied sciences
channel capacity
Communication
Exact sciences and technology
geometric programming
Information theory
Information, signal and communications theory
Telecommunications and information theory
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A duality relationship for the capacity of discrete memoryless channels is studied by means of geometric programming duality theory. A compulationally attractive dual approach and a family of algorithms which includes the classic Arimoto-Blahut method is proposed for the computation of capacity,
ISSN:0305-215X
1029-0273
DOI:10.1080/03052159208941224