The University of Southampton
University of Southampton Institutional Repository

Particle swarm optimization aided MIMO transceiver design

Particle swarm optimization aided MIMO transceiver design
Particle swarm optimization aided MIMO transceiver design
In this treatise, we design Particle Swarm Optimization (PSO) aided MIMO transceivers. The employment of multiple antennas leads to the concept of multiple-input multiple-output (MIMO) systems, which constitute an effective way of achieving an increased capacity. When multiple antennas are employed at the Base Station (BS), it is possible to employ Multiuser Detection (MUD) in the uplink. However, in the downlink (DL), due to the size as well as power consumption constraints of mobile devices, so-called Multiuser Transmission (MUT) techniques may be employed at the BS for suppressing the multiuser interference before transmissions, provided that the DL channel to be encountered may be accurately predicted.

The MUT scheme using the classic MMSE criterion is popular owing to its simplicity. However, since the BER is the ultimate system performance indicator, in this treatise we are more interested in the Minimum BER MUT (MBER-MUT) design. Unlike the MBER-MUD, the MBER-MUT design encounters a constrained nonlinear optimization problem due to the associated total transmit power constraint. Sequential Quadratic Programming (SQP) algorithms may be used to obtain the precoder’s coefficients. However, the computational complexity of the SQP based MBER-MUT solution may be excessive for high-rate systems. Hence, as an attractive design alternative, continuous-valued PSO was invoked to find the MBER-MUT’s precoder matrix in order to reduce its computational complexity.

Two PSO aided MBER-MUTs were designed and explained. The first one may be referred to as a symbol-specific MBER-MUT, while the other one may be termed as the average MBER-MUT. Our simulation results showed that both of our designs achieve an improvement in comparison to conventional linear MUT schemes, while providing a reduced complexity compared to the state-of-art SQP based MBER-MUT.

Later, we introduced discrete multi-valued PSO into the context of MMSE Vector Precoding (MMSEVP) to find the optimal perturbation vector. As a nonlinearMUT scheme, the VP provides an attractive BER performance. However, the computational complexity imposed during the search for optimal perturbation vector may be deemed excessive, hence it becomes necessary to find reduced-complexity algorithms while maintaining a reasonable BER performance. Lattice-Reduction-aied (LRA) VP is the most popular approach to reduce the complexity imposed. However, the LRA VP is only capable of achieving a suboptimum BER performance, although its complexity is reduced. Another drawback of LRA VP is that its complexity is fixed, which is beneficial for real-time implenebtations, but it is unable to strike a trade-off between the target BER and its required complexity. Therefore, we developed a discrete multi-valued PSO aided MMSE-VP design, which has a flexible complexity and it is capable of iteratively improving the achievable.

In Chapter 5, our contributions in the field of Minimum Bit Error Rate Vector Precoding (MBER-VP) are unveiled. Zero-Forcing Vector Precoding (ZF-VP) and MMSE Vector Precoding (MMSE-VP) had already been proposed in the literature. However, to the best of our knowledge, no VP algorithm was proposed to date based on the direct minimisation of the BER. Our improved MMSE-VP design based on the MBER criterion first invokes a regularised channel inversion technique and then superimposes a discrete-valued perturbation vector for minimising the BER of the system. To further improve the system’s BER performance, an MBER-based generalised continuous-valued VP algorithm was also proposed. Assuming the knowledge of the information symbol vector and the CIR matrix, we consider the generation of the effective symbol vector to be transmitted by directly minimising the BER of the system. Our simulation results show the advantage of these two VP schemes based on the MBER criterion, especially for rank-deficient systems, where the number of BS transmit antennas is lower than the number of MSs supported. The robustness of these two designs to the CIR estimation error are also investigated. Finally, the computational complexity imposed is also quantified in this chapter.

With the understanding of the BER criterion of VP schemes, we then considered a new transceiver design by combing uniform channel decomposition and MBER vector precoding, which leads to a joint transmitter and receiver design referred as the UCD-MBER-VP scheme. In our proposed UCD-MBER-VP scheme, the precoding and equalisation matrices are calculated by the UCD method, while the perturbation vector is directly chosen based on the MBER criterion. We demonstrated that the proposed algorithm outperforms the existing benchmark schemes, especially for rank-deficient systems, where the number of users supported is more than the number of transmit antennas employed. Moreover, our proposed joint design approach imposes a similar computational complexity as the existing benchmark schemes.
Yao, Wang
856490b4-cf1c-4dd8-8ab6-3acd64127232
Yao, Wang
856490b4-cf1c-4dd8-8ab6-3acd64127232
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1
Chen, Sheng
9310a111-f79a-48b8-98c7-383ca93cbb80

Yao, Wang (2011) Particle swarm optimization aided MIMO transceiver design. University of Southampton, School of Electronics and Computer Science, Doctoral Thesis, 195pp.

Record type: Thesis (Doctoral)

Abstract

In this treatise, we design Particle Swarm Optimization (PSO) aided MIMO transceivers. The employment of multiple antennas leads to the concept of multiple-input multiple-output (MIMO) systems, which constitute an effective way of achieving an increased capacity. When multiple antennas are employed at the Base Station (BS), it is possible to employ Multiuser Detection (MUD) in the uplink. However, in the downlink (DL), due to the size as well as power consumption constraints of mobile devices, so-called Multiuser Transmission (MUT) techniques may be employed at the BS for suppressing the multiuser interference before transmissions, provided that the DL channel to be encountered may be accurately predicted.

The MUT scheme using the classic MMSE criterion is popular owing to its simplicity. However, since the BER is the ultimate system performance indicator, in this treatise we are more interested in the Minimum BER MUT (MBER-MUT) design. Unlike the MBER-MUD, the MBER-MUT design encounters a constrained nonlinear optimization problem due to the associated total transmit power constraint. Sequential Quadratic Programming (SQP) algorithms may be used to obtain the precoder’s coefficients. However, the computational complexity of the SQP based MBER-MUT solution may be excessive for high-rate systems. Hence, as an attractive design alternative, continuous-valued PSO was invoked to find the MBER-MUT’s precoder matrix in order to reduce its computational complexity.

Two PSO aided MBER-MUTs were designed and explained. The first one may be referred to as a symbol-specific MBER-MUT, while the other one may be termed as the average MBER-MUT. Our simulation results showed that both of our designs achieve an improvement in comparison to conventional linear MUT schemes, while providing a reduced complexity compared to the state-of-art SQP based MBER-MUT.

Later, we introduced discrete multi-valued PSO into the context of MMSE Vector Precoding (MMSEVP) to find the optimal perturbation vector. As a nonlinearMUT scheme, the VP provides an attractive BER performance. However, the computational complexity imposed during the search for optimal perturbation vector may be deemed excessive, hence it becomes necessary to find reduced-complexity algorithms while maintaining a reasonable BER performance. Lattice-Reduction-aied (LRA) VP is the most popular approach to reduce the complexity imposed. However, the LRA VP is only capable of achieving a suboptimum BER performance, although its complexity is reduced. Another drawback of LRA VP is that its complexity is fixed, which is beneficial for real-time implenebtations, but it is unable to strike a trade-off between the target BER and its required complexity. Therefore, we developed a discrete multi-valued PSO aided MMSE-VP design, which has a flexible complexity and it is capable of iteratively improving the achievable.

In Chapter 5, our contributions in the field of Minimum Bit Error Rate Vector Precoding (MBER-VP) are unveiled. Zero-Forcing Vector Precoding (ZF-VP) and MMSE Vector Precoding (MMSE-VP) had already been proposed in the literature. However, to the best of our knowledge, no VP algorithm was proposed to date based on the direct minimisation of the BER. Our improved MMSE-VP design based on the MBER criterion first invokes a regularised channel inversion technique and then superimposes a discrete-valued perturbation vector for minimising the BER of the system. To further improve the system’s BER performance, an MBER-based generalised continuous-valued VP algorithm was also proposed. Assuming the knowledge of the information symbol vector and the CIR matrix, we consider the generation of the effective symbol vector to be transmitted by directly minimising the BER of the system. Our simulation results show the advantage of these two VP schemes based on the MBER criterion, especially for rank-deficient systems, where the number of BS transmit antennas is lower than the number of MSs supported. The robustness of these two designs to the CIR estimation error are also investigated. Finally, the computational complexity imposed is also quantified in this chapter.

With the understanding of the BER criterion of VP schemes, we then considered a new transceiver design by combing uniform channel decomposition and MBER vector precoding, which leads to a joint transmitter and receiver design referred as the UCD-MBER-VP scheme. In our proposed UCD-MBER-VP scheme, the precoding and equalisation matrices are calculated by the UCD method, while the perturbation vector is directly chosen based on the MBER criterion. We demonstrated that the proposed algorithm outperforms the existing benchmark schemes, especially for rank-deficient systems, where the number of users supported is more than the number of transmit antennas employed. Moreover, our proposed joint design approach imposes a similar computational complexity as the existing benchmark schemes.

PDF
report.pdf - Other
Download (5MB)

More information

Published date: January 2011
Organisations: University of Southampton, Southampton Wireless Group

Identifiers

Local EPrints ID: 301206
URI: http://eprints.soton.ac.uk/id/eprint/301206
PURE UUID: 747d65bd-5d41-4d5a-a513-3796bfb531ff
ORCID for Lajos Hanzo: ORCID iD orcid.org/0000-0002-2636-5214

Catalogue record

Date deposited: 27 Mar 2012 10:34
Last modified: 06 Jun 2018 13:15

Export record

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×