A Recursive quantizer design algorithm for binary-input discrete memoryless channels

Dabirnia, Mehdi; Martínez, Alfonso, 1973-; Guillén i Fábregas, A. (Albert)

doi:http://dx.doi.org/10.1109/TCOMM.2021.3076174

A Recursive quantizer design algorithm for binary-input discrete memoryless channels

Citació

Dabirnia M, Martinez A, Guillén i Fàbregas A. A Recursive quantizer design algorithm for binary-input discrete memoryless channels. IEEE Trans Commun. 2021;69(8):5069-78. DOI: 10.1109/TCOMM.2021.3076174

Resum

The optimal quantization of the outputs of binary-input discrete memoryless channels is considered, whereby the optimal quantizer preserves at least a constant α-fraction of the original mutual information, with the smallest output cardinality. Two recursive methods with top-down and bottom-up approaches are developed; these methods lead to a new necessary condition for the recursive quantizer design. An efficient algorithm with linear complexity, based on dynamic programming and the new necessary optimality condition, is proposed.