.png){kind=icon}
.png){kind=icon}
Return
A Recursive Quantizer Design Algorithm for Binary-Input Discrete Memoryless Channels
.png){kind=icon}
OA
AI
DOI：10.1109/TCOMM.2021.3076174.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The optimal quantization of output binary-input discrete memoryless channels is considered, whereby the optimal quantizer preserves at least a constant alpha-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.
Keywords:
Channel quantization
discrete memoryless channel
mutual information preserving quantizer
partitioning and clustering
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W