14 research outputs found
MIMO precoding for filter bank modulation systems based on PSVD
In this paper we consider the design of a linearly precoded MIMO transceiver based on filter bank (FB) modulation for transmission over broadband frequency selective fading channels. The modulation FB is capable of lowering the channel dispersion at sub-channel level. Nevertheless, the sub-channels experience some level of inter-symbol interference. Therefore, the pre-coder and the equalizer are designed exploiting the polynomial singular value decomposition (PSVD). In particular, we consider two types of FB system. The first system deploys maximal frequency confined pulses and it is referred to as filtered multitone (FMT) modulation, while the second uses maximal time confined pulses with rectangular impulse response, i.e., it corresponds to the conventional orthogonal frequency division multiplexing (OFDM) system. We compare the performance of the considered systems in terms of capacity over typical WLAN channels, showing that PSVD precoding with FMT can outperform the performance of precoded OFDM in the two-bytwo antenna case especially for moderate to low SNRs
Enhanced multi-user DMT spectrum management using polynomial matrix decomposition techniques
This thesis researches the increasingly critical roles played by intelligent resource management
and interference mitigation algorithms in present-day input multiple output (MIMO)
communication systems. This thesis considers the application of polynomial matrix decomposition
(PMD) algorithms, an emerging broadband factorisation technology for broadband
MIMO access networks. Present DSL systemsâ performance is constrained by the presence
of interference (crosstalk) between multiple users sharing a common physical cable bundle.
Compared to the traditional static spectrum management methods that define their survival
to the worst-case scenarios, DSM methods provides some degree of flexibility to both direct
channel and noise parameters to improve evolvability and robustness significantly. A novel
crosstalk-aware DSM algorithm is proposed for the efficient management of multi-user DSL
systems. Joint power allocation procedures are considered for the proposed single-channel
equalisation method in DSL access networks.
This thesis then shows that DSM can also benefit overdetermined precoding-equalisation
systems, when the channel state information (CSI) parameters call for a specific decision
feedback criterion to achieve a perfect reconstruction. A reasonable redundancy is introduced
to reformulate the original multi-user MIMO problem into the simplest case of power
management problem. DSM algorithms are primarily applied to solve the power allocation
problem in DSM networks with the aim of maximising the system attribute rather than
meeting specific requirements. Also, a powerful PMD algorithm known as sequential
matrix diagonalisation (SMD) is used for analysing the eigenvalue decomposition problem
by quantifying the available system resource including the effects of the crosstalk and its
parameters. This analysis is carried out through joint precoding and equalisation structures.
The thesis also investigates dynamic interference mitigation strategies for improving
the performance of DSL networks. Two different mitigation strategies through a decision
feedback equalisation (DFE) criterion are considered, including zero-forcing (ZF) and
minimum mean square error (MMSE) equalisers. The difference between ZF and MMSE
equalisations is analysed. Some experimental simulation results demonstrate the performance
of both ZF and MMSE equalisation under the DFE equalisation constraint settings. Model reduction on the MMSE equalisation is thus applied to balance the crosstalk interference and
enhance the data-rate throughput.
Finally, the thesis studies a multi-user MIMO problem under the utility maximisation
framework. Simulation results illustrate that the power allocation of multi-user DSL transmission
can be jointly controlled and the interference can often be mitigated optimally on
a single user basis. Driven by imperfect CSI information in current DSL networks, the
research presents a novel DSM method that allows not only crosstalk mitigation, but also the
exploitation of crosstalk environments through the fielding of versatile, flexible and evolvable
systems. The proposed DSM tool is presented to achieve a robust mitigating system in any
arbitrary overdetermined multi-user MIMO environment. Numerical optimisation results show that the mitigation of crosstalk impairment using the proposed DSM strategy. The design and implementation of the proposed DSM are carried out in the environment of
MATLAB
PLC for the smart grid: state-of-the-art and challenges
This paper aims to review systems and applications for power line communications (PLC) in the context of the smart grid. We discuss the main applications and summarise state-of-the-art PLC systems and standards. We report efforts and challenges in channel and noise modelling, as well as in state-of-the-art transmission technology approaches
Polynomial matrix eigenvalue decomposition techniques for multichannel signal processing
Polynomial eigenvalue decomposition (PEVD) is an extension of the eigenvalue decomposition (EVD) for para-Hermitian polynomial matrices, and it has been shown to be a powerful tool for broadband extensions of narrowband signal processing problems. In the context of broadband sensor arrays, the PEVD allows the para-Hermitian matrix that results from the calculation of a space-time covariance matrix of the convolutively mixed signals to be diagonalised. Once the matrix is diagonalised, not only can the correlation between different sensor signals be removed but the signal and noise subspaces can also be identified. This process is referred to as broadband subspace decomposition, and it plays a very important role in many areas that require signal separation techniques for multichannel convolutive mixtures, such as speech recognition, radar clutter suppression, underwater acoustics, etc. The multiple shift second order sequential best rotation (MS-SBR2) algorithm, built on the most established SBR2 algorithm, is proposed to compute the PEVD of para-Hermitian matrices. By annihilating multiple off-diagonal elements per iteration, the MS-SBR2 algorithm shows a potential advantage over its predecessor (SBR2) in terms of the computational speed. Furthermore, the MS-SBR2 algorithm permits us to minimise the order growth of polynomial matrices by shifting rows (or columns) in the same direction across iterations, which can potentially reduce the computational load of the algorithm. The effectiveness of the proposed MS-SBR2 algorithm is demonstrated by various para-Hermitian matrix examples, including randomly generated matrices with different sizes and matrices generated from source models with different dynamic ranges and relations between the sourcesâ power spectral densities. A worked example is presented to demonstrate how the MS-SBR2 algorithm can be used to strongly decorrelate a set of convolutively mixed signals. Furthermore, the performance metrics and computational complexity of MS-SBR2 are analysed and compared to other existing PEVD algorithms by means of numerical examples. Finally, two potential applications of theMS-SBR2 algorithm, includingmultichannel spectral factorisation and decoupling of broadband multiple-input multiple-output (MIMO) systems, are demonstrated in this dissertation
Mathematical tools for processing broadband multi-sensor signals
Spatial information in broadband array signals is embedded in the relative delay with which sources illuminate different sensors. Therefore, second order statistics, on which cost functions such as the mean square rest, must include such delays. Typically, a space-time covariance matrix therefore arises, which can be represented as a Laurent polynomial matrix. The optimisation of a cost function then requires extending the utility of the eigenvalue decomposition from narrowband covariance matrices to the broadband case of operating in a space-time covariance matrix. This overview paper summarises efforts in performing such factorisations, and demonstrated via the exemplar application of a broadband beamformer how thus well-known narrowband solutions can be extended to the broadband case using polynomial matrices and their factorisations