Dabirnia, MehdiMartínez, Alfonso, 1973-Guillén i Fábregas, A. (Albert)2021-05-192021Dabirnia 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.30761740090-6778http://hdl.handle.net/10230/47591The 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.application/pdfeng© 2021 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. http://dx.doi.org/10.1109/TCOMM.2021.3076174info:eu-repo/semantics/articlehttp://dx.doi.org/10.1109/TCOMM.2021.3076174Channel quantizationDiscrete memoryless channelMutual information preserving quantizerPartitioning and clusteringinfo:eu-repo/semantics/openAccess