اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOn Complex LLL Algorithm for Integer Forcing Linear Receivers
162
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Integer-forcing (IF) linear receiver has been recently introduced for multiple-input multiple-output (MIMO) fading channels. The receiver has to compute an integer linear combination of the symbols as a part of the decoding process. In particular, the integer coefficients have to be chosen based on the channel realizations, and the choice of such coefficients is known to determine the receiver performance. The original known solution of finding these integers was based on exhaustive search. A practical algorithm based on Hermite-Korkine-Zolotareff (HKZ) and Minkowski lattice reduction algorithms was also proposed recently. In this paper, we propose a low-complexity method based on complex LLL algorithm to obtain the integer coefficients for the IF receiver. For the 2 X 2 MIMO channel, we study the effectiveness of the proposed method in terms of the ergodic rate. We also compare the bit error rate (BER) of our approach with that of other linear receivers, and show that the suggested algorithm outperforms the minimum mean square estimator (MMSE) and zero-forcing (ZF) linear receivers, but trades-off error performance for complexity in comparison with the IF receiver based on exhaustive search or on HKZ and Minkowski lattice reduction algorithms.
قيم البحث
اقرأ أيضاً
A new architecture called integer-forcing (IF) linear receiver has been recently proposed for multiple-input multiple-output (MIMO) fading channels, wherein an appropriate integer linear combination of the received symbols has to be computed as a par
t of the decoding process. In this paper, we propose a method based on Hermite-Korkine-Zolotareff (HKZ) and Minkowski lattice basis reduction algorithms to obtain the integer coefficients for the IF receiver. We show that the proposed method provides a lower bound on the ergodic rate, and achieves the full receive diversity. Suitability of complex Lenstra-Lenstra-Lovasz (LLL) lattice reduction algorithm (CLLL) to solve the problem is also investigated. Furthermore, we establish the connection between the proposed IF linear receivers and lattice reduction-aided MIMO detectors (with equivalent complexity), and point out the advantages of the former class of receivers over the latter. For the $2 times 2$ and $4times 4$ MIMO channels, we compare the coded-block error rate and bit error rate of the proposed approach with that of other linear receivers. Simulation results show that the proposed approach outperforms the zero-forcing (ZF) receiver, minimum mean square error (MMSE) receiver, and the lattice reduction-aided MIMO detectors.
In multiple-input multiple-output (MIMO) fading channels, the design criterion for full-diversity space-time block codes (STBCs) is primarily determined by the decoding method at the receiver. Although constructions of STBCs have predominantly matche
d the maximum-likelihood (ML) decoder, design criteria and constructions of full-diversity STBCs have also been reported for low-complexity linear receivers. A new receiver architecture called Integer-Forcing (IF) linear receiver has been proposed to MIMO channels by Zhan et al. which showed promising results for the high-rate V-BLAST encoding scheme. In this paper, we address the design of full-diversity STBCs for IF linear receivers. In particular, we are interested in characterizing the structure of STBCs that provide full-diversity with the IF receiver. Along that direction, we derive an upper bound on the probability of decoding error, and show that STBCs that satisfy the restricted non-vanishing singular value (RNVS) property provide full-diversity for the IF receiver. Furthermore, we prove that all known STBCs with the non-vanishing determinant property provide full-diversity with IF receivers, as they guarantee the RNVS property. By using the formulation of RNVS property, we also prove the existence of a full-diversity STBC outside the class of perfect STBCs, thereby adding significant insights compared to the existing works on STBCs with IF decoding. Finally, we present extensive simulation results to demonstrate that linear designs with RNVS property provide full-diversity for IF receiver.
In multiple-input multiple-output (MIMO) fading channels, the design criterion for full-diversity space-time block codes (STBCs) is primarily determined by the decoding method at the receiver. Although constructions of STBCs have predominantly matche
d the maximum-likelihood (ML) decoder, design criteria and constructions of full-diversity STBCs have also been reported for low-complexity linear receivers. A new receiver architecture called Integer-Forcing (IF) linear receiver has been proposed to MIMO channels by Zhan et al. which showed promising results for the high-rate V-BLAST encoding scheme. In this work we address the design of full-diversity STBCs for IF linear receivers. We derive an upper bound on the probability of decoding error, and show that STBCs that satisfy the non-vanishing singular value (NVS) property provide full-diversity for the IF receiver. We also present simulation results to demonstrate that linear designs with NVS property provide full diversity for IF receiver. As a special case of our analysis on STBCs, we present an upper bound on the error probability for the V-BLAST architecture presented by Zhan emph{et al.}, and demonstrate that the IF linear receivers provide full receive diversity. Our results supplement the existing outage probability based results for the IF receiver.
Integer-Forcing (IF) is a new framework, based on compute-and-forward, for decoding multiple integer linear combinations from the output of a Gaussian multiple-input multiple-output channel. This work applies the IF approach to arrive at a new low-co
mplexity scheme, IF source coding, for distributed lossy compression of correlated Gaussian sources under a minimum mean squared error distortion measure. All encoders use the same nested lattice codebook. Each encoder quantizes its observation using the fine lattice as a quantizer and reduces the result modulo the coarse lattice, which plays the role of binning. Rather than directly recovering the individual quantized signals, the decoder first recovers a full-rank set of judiciously chosen integer linear combinations of the quantized signals, and then inverts it. In general, the linear combinations have smaller average powers than the original signals. This allows to increase the density of the coarse lattice, which in turn translates to smaller compression rates. We also propose and analyze a one-shot version of IF source coding, that is simple enough to potentially lead to a new design principle for analog-to-digital converters that can exploit spatial correlations between the sampled signals.
Integer-forcing (IF) precoding, also known as downlink IF, is a promising new approach for communication over multiple-input multiple-output (MIMO) broadcast channels. Inspired by the integer-forcing linear receiver for multiple-access channels, it g
eneralizes linear precoding by inducing an effective channel matrix that is approximately integer, rather than approximately identity. Combined with lattice encoding and a pre-inversion of the channel matrix at the transmitter, the scheme has the potential to outperform any linear precoding scheme, despite enjoying similar low complexity. In this paper, a specific IF precoding scheme, called diagonally-scaled exact IF (DIF), is proposed and shown to achieve maximum spatial multiplexing gain. For the special case of two receivers, in the high SNR regime, an optimal choice of parameters is derived analytically, leading to an almost closed-form expression for the achievable sum rate. In particular, it is shown that the gap to the sum capacity is upper bounded by 0.27 bits for any channel realization. For general SNR, a regularized version of DIF (RDIF) is proposed. Numerical results for two receivers under Rayleigh fading show that RDIF can achieve performance superior to optimal linear precoding and very close to the sum capacity.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
