On probabilistic data association for achieving near-exponential diversity over fading channels

Abstract

Machine-to-Machine (M2M) wireless communication requires the transmission of short blocks of data with high reliability over fading channels. We discuss the use of the probabilistic data association (PDA) detector in conjunction with precoding to design high-performance systems for these links. First, the performance of the traditional PDA algorithm with precoding over ideal Rayleigh fading links is analyzed, which provides insight into its performance, and evidence of an error floor at high SNRs. Then, a novel ordering mechanism is proposed that takes advantage of the precoder characteristics. It is shown by simulation that the proposed modified algorithm can achieve near-ML performance for block sizes as small as 32 symbols IEEE International Conference on Communications (ICC)This work may not be copied or reproduced in whole or in part for any commercial purpose. Permission to copy in whole or in part without payment of fee is granted for nonprofit educational and research purposes provided that all such whole or partial copies include the following: a notice that such copying is by permission of Mitsubishi Electric Research Laboratories, Inc.; an acknowledgment of the authors and individual contributions to the work; and all applicable portions of the copyright notice. Copying, reproduction, or republishing for any other purpose shall require a license with payment of fee to Mitsubishi Electric Research Laboratories, Inc. All rights reserved. Abstract-Machine-to-Machine (M2M) wireless communication requires the transmission of short blocks of data with high reliability over fading channels. We discuss the use of the probabilistic data association (PDA) detector in conjunction with precoding to design high-performance systems for these links. First, the performance of the traditional PDA algorithm with precoding over ideal Rayleigh fading links is analyzed, which provides insight into its performance, and evidence of an error floor at high SNRs. Then, a novel ordering mechanism is proposed that takes advantage of the precoder characteristics. It is shown by simulation that the proposed modified algorithm can achieve near-ML performance for block sizes as small as 32 symbols Index Terms-Machine-to-Machine (M2M) Communication, single-input single-output (SISO) channel, precoding, probabilistic data association (PDA) algorithm, ordered-PDA.

Achieving Optimum Received Power for Discrete-Phase RISs With Elementwise Updates in the Least Number of Steps

“…Because |g| is real-valued, the second and fourth terms in (17) sum to zero, and (18) from which (15) follows as a necessary and sufficient condition for the lemma to hold. ■ Reference [15] attempts to decide a range of µ for which θ * n = kω must hold.…”

“…To guarantee the optimal solution, most of the prior work in single-user scenarios had exponential complexity, sometimes over the number of RIS elements (N ) [10], and sometimes over the phase shift levels (K) [16]. In this regard, probabilistic optimization techniques have also drawn attention [17], [18], [19]. In [17], the idea of probabilistic data association (PDA) is used to address general binary quadratic problems (BQPs) for multi-user detection in code division multiple access.…”

“…In [17], the idea of probabilistic data association (PDA) is used to address general binary quadratic problems (BQPs) for multi-user detection in code division multiple access. Machine-to-machine wireless communication with high reliability is considered in [18], where authors approached BQPs by developing a PDA algorithm, achieving near-optimal results. Recently, authors in [19] developed a comprehensive probabilistic technique to address the quantization error and scalability issues in a variety of discrete RIS optimization problems, where the proposed technique outperforms general approaches such as the closest point projection (CPP) method given in [13].…”

Fifty Years of MIMO Detection: The Road to Large-Scale MIMOs

“…[121], [132], [602] Nt [104], [116], [118] where Mi is the number of PDA iterations SDPR Nr only for BPSK transmission over See [135], [137], [603] Typically near-ML Constellation-dependent:…”