A Recursive quantizer design algorithm for binary-input discrete memoryless channels
Mostra el registre complet Registre parcial de l'ítem
- dc.contributor.author Dabirnia, Mehdi
- dc.contributor.author Martínez, Alfonso, 1973-
- dc.contributor.author Guillén i Fábregas, A. (Albert)
- dc.date.accessioned 2021-05-19T07:15:29Z
- dc.date.issued 2021
- dc.description.abstract 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.
- dc.description.sponsorship This work has been funded in part by the European Research Council under grant 725411, and by the Spanish Ministry of Economy and Competitiveness under grant TEC2016-78434-C3-1-R.
- dc.format.mimetype application/pdf
- dc.identifier.citation 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
- dc.identifier.doi http://dx.doi.org/10.1109/TCOMM.2021.3076174
- dc.identifier.issn 0090-6778
- dc.identifier.uri http://hdl.handle.net/10230/47591
- dc.language.iso eng
- dc.publisher Institute of Electrical and Electronics Engineers (IEEE)
- dc.relation.ispartof IEEE Transactions on Communications. 2021;69(8):5069-78.
- dc.relation.projectID info:eu-repo/grantAgreement/EC/H2020/725411
- dc.relation.projectID info:eu-repo/grantAgreement/ES/1PE/TEC2016-78434-C3-1-R
- dc.rights © 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.3076174
- dc.rights.accessRights info:eu-repo/semantics/openAccess
- dc.subject.keyword Channel quantization
- dc.subject.keyword Discrete memoryless channel
- dc.subject.keyword Mutual information preserving quantizer
- dc.subject.keyword Partitioning and clustering
- dc.title A Recursive quantizer design algorithm for binary-input discrete memoryless channels
- dc.type info:eu-repo/semantics/article
- dc.type.version info:eu-repo/semantics/acceptedVersion