The University of Southampton
University of Southampton Institutional Repository

A Reduced-Complexity Partial-Interference-Cancellation Group Decoder for STBCs

A Reduced-Complexity Partial-Interference-Cancellation Group Decoder for STBCs
A Reduced-Complexity Partial-Interference-Cancellation Group Decoder for STBCs
In this paper, we propose a reduced-complexity implementation of partial interference cancellation group decoder with successive interference cancellation (PIC-GD-SIC) by employing the theory of displacement structures. The proposed algorithm exploits the block-Toeplitz structure of the effective matrix and chooses an ordering of the groups such that the zero-forcing matrices associated with the various groups are obtained through Schur recursions without any approximations. We show using an example that the proposed implementation offers a significantly reduced computational complexity compared to the direct approach without any loss in performance.
Rajashekar, Rakshith
b6bfc273-4ed6-4cd7-8e3c-31d15549dfc0
Hari, K. V. S.
93c59427-eaf1-49f6-8943-d465d6366d43
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1
Rajashekar, Rakshith
b6bfc273-4ed6-4cd7-8e3c-31d15549dfc0
Hari, K. V. S.
93c59427-eaf1-49f6-8943-d465d6366d43
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1

Rajashekar, Rakshith, Hari, K. V. S. and Hanzo, Lajos (2013) A Reduced-Complexity Partial-Interference-Cancellation Group Decoder for STBCs. IEEE Signal Processing Letters. (In Press)

Record type: Article

Abstract

In this paper, we propose a reduced-complexity implementation of partial interference cancellation group decoder with successive interference cancellation (PIC-GD-SIC) by employing the theory of displacement structures. The proposed algorithm exploits the block-Toeplitz structure of the effective matrix and chooses an ordering of the groups such that the zero-forcing matrices associated with the various groups are obtained through Schur recursions without any approximations. We show using an example that the proposed implementation offers a significantly reduced computational complexity compared to the direct approach without any loss in performance.

Text
lsp-hanzo-2273532-x.pdf - Other
Download (242kB)

More information

Accepted/In Press date: 2013
Organisations: Southampton Wireless Group

Identifiers

Local EPrints ID: 354926
URI: http://eprints.soton.ac.uk/id/eprint/354926
PURE UUID: d54cef6d-120b-48ab-a151-0029bd507f1c
ORCID for Lajos Hanzo: ORCID iD orcid.org/0000-0002-2636-5214

Catalogue record

Date deposited: 23 Jul 2013 09:50
Last modified: 15 Mar 2024 02:38

Export record

Contributors

Author: Rakshith Rajashekar
Author: K. V. S. Hari
Author: Lajos Hanzo ORCID iD

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.

×