We consider a communication channel whose input is modeled as a discrete random variable X with distribution pX. X is transmitted over a noisy channel and distorted by a continuous-valued noise to result in a continuous-valued output signal U at the receiver. A thresholding quantizer Q is applied to reconstruct a discrete signal V = Q(U) from the continuous-valued U. Our goal is to jointly design both the input distribution pX and the thresholding quantizer Q to maximize the mutual information I(X; V) between the input X and V since the accuracy of any decoding algorithm that estimates X from V fundamentally depends on I(X; V). In this paper, an alternating maximization algorithm is proposed that guarantees to achieve a locally optimal solution. In addition, we numerically show that by randomly selecting a set of initial starting points, the proposed algorithm is capable of achieving the globally optimal solution. Both the theoretical and numerical results are provided to justify our approach.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Capacity achieving quantizer design for multiple-input multiple-output thresholding channels


    Contributors:
    Vuong, An (author) / Nguyen, Thuan (author) / Nguyen, Thinh (author)


    Publication date :

    2023-06-01


    Size :

    1521624 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English





    Initial Investigation of Multiple-Input Multiple-Output (MIMO) Channels in Indoor Environments

    McNamara, D. P. / Beach, M. A. / Fletcher, P. N. et al. | British Library Conference Proceedings | 2000


    Capacity Enhancement with Joint Precoding for Multiple-Input Multiple-Output Downlink System

    Hanif, Mohammad Abu / Song, Sang Seob / Lee, Moon Ho | IEEE | 2015


    Design of Multiple Input Multiple Output Volterra Filter Equalizer

    Yangwang, F. / Licheng, J. / Jing, L. | British Library Online Contents | 2001