Title :
Concatenation of a discrete memoryless channel and a quantizer
Author :
Kurkoski, Brian M. ; Yagi, Hideki
Author_Institution :
Dept. of Inf. & Commun. Eng., Univ. of Electro-Commun., Chofu, Japan
Abstract :
The concatenation of an arbitrary discrete memoryless channel with binary input followed by a quantizer is considered. For a restricted quantizer alphabet size, it is shown that the maximum of the mutual information between the channel input and the quantizer output can be found by dynamic programming. Numerical examples are given to illustrate the results. This problem is shown to be an example of concave programming.
Keywords :
channel coding; concave programming; dynamic programming; quantisation (signal); telecommunication channels; arbitrary discrete memoryless channel; channel coding; channel input; concave programming; dynamic programming; quantizer output; restricted quantizer alphabet size; Channel capacity; Dynamic programming; Iterative decoding; Memoryless systems; Mutual information; Optimization methods; Parity check codes; Quantization; Turbo codes; Yagi-Uda antennas;
Conference_Titel :
Information Theory (ITW 2010, Cairo), 2010 IEEE Information Theory Workshop on
Conference_Location :
Cairo
Print_ISBN :
978-1-4244-6372-5
DOI :
10.1109/ITWKSPS.2010.5503164
