scispace - formally typeset
Journal ArticleDOI

Polynomial matrix QR decomposition for the decoding of frequency selective multiple-input multiple-output communication channels

Reads0
Chats0
TLDR
The polynomial matrix system is shown to achieve improved performance in terms of average bit error rate results, as a consequence of time-domain symbol decoding.
Abstract
This study proposes a new technique for communicating over multiple-input multiple-output (MIMO) frequency selective channels. This approach operates by calculating the QR decomposition of the polynomial channel matrix at the receiver on the basis of channel state information, which in this work is assumed to be perfectly known. This then enables the frequency selective MIMO system to be transformed into a set of frequency selective single-input single-output systems without altering the statistical properties of the receiver noise, which can then be individually equalised. A like-for-like comparison with the orthogonal frequency division multiplexing scheme, which is typically used to communicate over channels of this form, is provided. The polynomial matrix system is shown to achieve improved performance in terms of average bit error rate results, as a consequence of time-domain symbol decoding.

read more

Citations
More filters
Journal ArticleDOI

Sequential Matrix Diagonalization Algorithms for Polynomial EVD of Parahermitian Matrices

TL;DR: A new iterative PEVD algorithm based on sequential matrix diagonalization (SMD) is introduced, and it is demonstrated that SMD establishes diagonalization faster and with lower order operations than existing PEVD algorithms.
Journal ArticleDOI

Relevance of polynomial matrix decompositions to broadband blind signal separation

TL;DR: The paper focuses on the applicability of the PEVD and broadband subspace techniques enabled by the diagonalisation and spectral majorisation capabilities of PEVD algorithms to define broadband BSS solutions that generalise well-known narrowband techniques based on the EVD.
Journal ArticleDOI

Novel Reconfigurable Hardware Architecture for Polynomial Matrix Multiplications

TL;DR: A novel reconfigurable hardware architecture for computing the polynomial matrix multiplication (PMM), the first one devoted to the hardware implementation of PMM, is introduced and the results verify that the proposed solution gives low execution times while limiting the number of required FPGA resources.
Journal ArticleDOI

Efficient Implementation of Iterative Polynomial Matrix EVD Algorithms Exploiting Structural Redundancy and Parallelisation

TL;DR: A novel algorithm titled parallel-sequential matrix diagonalisation exhibits significantly reduced algorithmic complexity and run-time when compared with existing iterative PEVD methods, and can improve eigenvalue resolution at the expense of decomposition mean squared error.
Journal ArticleDOI

LU-Based Beamforming Schemes for MIMO Systems

TL;DR: The proposed beamforming scheme can be used both in orthogonal frequency-division multiplexing (OFDM) and in single-carrier MIMO systems, without a cyclic prefix (CP).
References
More filters
Book

Matrix computations

Gene H. Golub
Book

Wireless Communications

Book

Introduction to Space-Time Wireless Communications

TL;DR: This book is an accessible introduction to every fundamental aspect of space-time wireless communications and a powerful tool for improving system performance that already features in the UMTS and CDMA2000 mobile standards.
Journal ArticleDOI

Frequency domain equalization for single-carrier broadband wireless systems

TL;DR: This article surveys frequency domain equalization (FDE) applied to single-carrier (SC) modulation solutions and discusses similarities and differences of SC and OFDM systems and coexistence possibilities, and presents examples of SC-FDE performance capabilities.
Related Papers (5)