Abstract
A computational scheme for calculating the capacity of continuous-input discrete-output memoryless channels is presented. By adopting relative entropy as a performance measure between two channel transition probabilities the method suggests an algorithm to discretize continuous channel inputs into a set of finite desired channel inputs so that the discrete version of the well-known Arimoto-Blahut algorithm is readily applied. Compared to recent algorithms developed by Chang and Davisson, the algorithm has a simple structure for numerical implementations. To support this justification a numerical example is studied and the relative performance is compared based on computing time.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
