Abstract

We prove, for the first time in the literature of communication theory and machine learning, the equivalence of joint maximum-likelihood (ML) optimal channel estimation and data detection (JOCEDD) to the problem of finding the L 1 -norm principal components of a real-valued data matrix. Optimal algorithms for L 1 -norm principal component analysis (PCA) are therefore direct solvers to the problem of interest, thus the proposed JOCEDD approach requires a polynomial number of operations. To avoid high computational costs incurred by the exact calculation of optimal L 1 principal components, we implement an efficient bit flipping-based algorithm for L 1 -norm PCA in a software-defined radio. In particular, we carry out experiments with two radios that operate at Wi-Fi frequencies in a multipath indoor radio environment and have no direct line-of-sight. We apply L 1 -norm PCA for JOCEDD over short frames that are transmitted over the single-input single-output communication link. We compare the performance of supervised data-aided channel estimation techniques versus JOCEDD in terms of bit-error-rate and demonstrate the superiority of the proposed approach across a wide range of signal-to-noise ratios.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.