On Computation of Lower Bound of E Capacity for the Channel with Two-Sided State Information
Abstract
In this paper a discrete memoryless channel (DMC) with 2 sided state information is examined in the sense of computations of capacity formulas and random-coding exponents. It is shown that computation of channel capacity and lower bound of E capacity requires a huge amount of computational resources and is rather slow when implemented with traditional methods. Techniques are described how to massively parallelize the computations by means of GPGPU and obtain substantial acceleration.
References
T.M. Cover and M. Chiang, “Duality between channel capacity and rate distortion with two-sided state information", IEEE Transactions on Information Theory, vol. 48, no. 6, pp. 1629-1638, 2002.
M. Haroutunian, A. Muradyan, “Lower bound for E capacity of discrete memoryless channel with two-sided state information", Transactions of the Institute for Informatics and Automation Problems of the NAS of RA, Mathematical Problems of Computer Sciences, vol. 31, pp. 28-39, 2008.
D. Luebke, G. Humphreys, “How GPUs work", IEEE Computer, 2007
R. Wang, N. Goodnight, G. Humphreys, “Computation on programmable graphics hardware", IEEE Computer Graphics and Applications, 2005.
J. Hennessy, D. Patterson, “Computer architecture: a quantitative approach", ISBN 1-55860-724-2, 3rd edition, 2003.
G. Moore, “Cramming more components onto integrated circuits", Electronics, vol. 38, no 8, 1965.
J. Owens, D. Luebke, “A surveyof general-purpose computation on graphics hardware", Computer Graphics Forum, vol. 26, no 1, pp. 80-113, 2007.
M. Harris, “Mapping computational concepts to GPUs", International Conference on Computer Graphics and Interactive Techniques, no 50, 2005.
D. Ibaroudene, “Parallel processing", Chapter 1, Motivation and History. St Mary's University, San Antonio, 2008.
T. Cormen, C. Leiserson, R. Rivest, C. Stein, “Introduction to algorithms", ISBN 978-0-262-03293-3, MIT Press, 2001.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
