Enhanced List-based Group-wise overloaded receiver with application to satellite reception

Abstract

Abstract-The market trends towards the use of smaller dish antennas for TV satellite receivers, as well as the growing density of broadcasting satellites in orbit require the application of robust adjacent satellite interference (ASI) cancellation algorithms at the receivers. The wider beamwidth of a small size dish and the growing number of satellites in orbit impose an overloaded scenario, i.e., a scenario where the number of transmitting satellites exceeds the number of receiving antennas. For such a scenario, we present a two stage receiver to enhance signal detection from the satellite of interest, i.e., the satellite that the dish is pointing to, while reducing interference from neighboring satellites. Towards this objective, we propose an enhanced List-based Group-wise Search Detection (LGSD) receiver architecture that takes into account the spatially correlated additive noise and uses the signal-to-interference-plusnoise ratio (SINR) maximization criterion to improve detection performance. Simulations show that the proposed receiver structure enhances the performance of satellite systems in the presence of ASI when compared to existing methods.

Reduced complexity satellite broadcast receiver with interference mitigation in correlated noise

“…In the subsequent iterations, the group allocation is made at random to diversify the detection process in each iteration. B.RC‐LGSD complexity vs performance trade‐offIn this subsection, we investigate the effect of iteration numbers I GLB , I BLE , and I GLO on the receiver performance and the incurred complexity. Subsequently, we select a suitable trade‐off between performance and complexity and compare the proposed receiver to that of Krause et al and Abu‐Shaban et al for 8PSK and 16APSK modulations. …”

“…Based on this truncation, we improve the performance of the E‐LGSD and propose RC‐LGSD receiver. We carry out extensive Monte Carlo simulations to investigate the performance of the proposed receiver in realistic scenarios. Our simulations show that RC‐LGSD can outperform the conventional LGSD, while having a lower complexity than E‐LGSD . Moreover, we perform an in‐depth numerical investigation on the impact of various algorithm parameters and the interesting trade‐off between performance and complexity.…”

“…It is easy to show that the complexity of JML is given by C JML =2 M K N . Therefore, the complxity of RC‐LGSD for a receiver with M BLEs is B.Complexity of RC‐LGSD relative to LGSD and E‐LGSDTo compare the complexity of the RC‐LGSD with LGSD and E‐LGSD, we compute the complexity saving of RC‐LGSD as a percentage of their complexity, both of which use N BLEs. This percentage is given by It can be shown that R is much smaller that the other terms in .…”

“…To compare the complexity of the RC‐LGSD with LGSD and E‐LGSD, we compute the complexity saving of RC‐LGSD as a percentage of their complexity, both of which use N BLEs. This percentage is given by It can be shown that R is much smaller that the other terms in .…”

“…Our simulations show that RC-LGSD can outperform the conventional LGSD, 10 while having a lower complexity than E-LGSD. 15 Moreover, we perform an in-depth numerical investigation on the impact of various algorithm parameters and the interesting trade-off between performance and complexity.…”