Concatenation of a discrete memoryless channel and a quantizer

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.