1 July 2001 in IEEE Communications Letters
Orthogonal frequency-division multiplexing (OFDM), with the help of a cyclic prefix, enables low complexity frequency domain equalization, but suffers from a high crest factor. Single carrier with cyclic prefix (SC-CP) has the same advantage with similar performance, but with a lower crest factor and enhanced robustness to phase noise. The cyclic prefix is overhead, so we put more information in it by implementing this cyclic prefix as a training sequence (TS). This new training aided frequency domain equalized single carrier (TASC) scheme offers us additional known symbols and enables better synchronization and (potentially) channel estimation, with the same performance as SC-CP.
16 July 2018 in IEEE Transactions on Wireless Communications
One of the biggest challenges in operating massive multiple-input multiple-output systems is the acquisition of accurate channel state information at the transmitter. To take up this challenge, time division duplex is more favorable thanks to its channel reciprocity between downlink and uplink. However, while the propagation channel over the air is reciprocal, the radio-frequency front-ends in the transceivers are not. Therefore, calibration is required to compensate the RF hardware asymmetry. Although various over-the-air calibration methods exist to address the above problem, this paper offers a unified representation of these algorithms, providing a higher level view on the calibration problem, and introduces innovations on calibration methods. We present a novel family of calibration methods, based on antenna grouping, which improve accuracy and speed up the calibration process compared to existing methods. We then provide the Cramér-Rao bound as the performance evaluation benchmark and compare maximum likelihood and least squares estimators. We also differentiate between coherent and noncoherent accumulation of calibration measurements, and point out that enabling non-coherent accumulation allows the training to be spread in time, minimizing impact to the data service. Overall, these results have special value in allowing to design reciprocity calibration techniques that are both accurate and resource-effective.
1 January 2012 in SIAM Journal on Matrix Analysis and Applications
Canonical polyadic decomposition (CPD) of a higher-order tensor is an important tool in mathematical engineering. In many applications at least one of the matrix factors is constrained to be columnwise orthonormal. We first derive a relaxed condition that guarantees uniqueness of the CPD under this constraint. Second, we give a simple proof of the existence of the optimal low-rank approximation of a tensor in the case that a factor matrix is columnwise orthonormal. Third, we derive numerical algorithms for the computation of the constrained CPD. In particular, orthogonality-constrained versions of the CPD methods based on simultaneous matrix diagonalization and alternating least squares are presented. Numerical experiments are reported.