The University of Southampton
University of Southampton Institutional Repository

Space-Time Codes and Concatenated Channel Codes for Wireless Communications

Space-Time Codes and Concatenated Channel Codes for Wireless Communications
Space-Time Codes and Concatenated Channel Codes for Wireless Communications
Following a brief historical perspective on channel coding, an introduction to space–time block codes is given. The various space–time codes considered are then concatenated with a range of channel codecs, such as convolutional and block-based turbo codes as well as conventional and turbo trellis codes. The associated estimated complexity issues and memory requirements are also considered. These discussions are followed by a performance study of various space–time and channel-coded transceivers. Our aim is first to identify a space–time code/channel code combination constituting a good engineering tradeoff in terms of its effective throughput, bit-error-rate performance, and estimated complexity. Specifically, the issue of bit-to-symbol mapping is addressed in the context of convolutional codes (CCs) and convolutional coding as well as Bose–Chaudhuri–Hocquenghem coding-based turbo codes in conjunction with an attractive unity-rate space–time code and multilevel modulation is detailed. It is concluded that over the nondispersive or narrow-band fading channels, the best performance versus complexity tradeoff is constituted by Alamouti’s twin-antenna block space–time code concatenated with turbo convolutional codes. Further comparisons with space–time trellis codes result in similar conclusions. Keywords—Channel coding, concatenated coding, FEC, history of channel coding, space–time coding, STBC, STTC.
0018-9219
187-219
Liew, T.H.
a431a389-23f9-4360-9c85-8f4265770636
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1
Liew, T.H.
a431a389-23f9-4360-9c85-8f4265770636
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1

Liew, T.H. and Hanzo, Lajos (2002) Space-Time Codes and Concatenated Channel Codes for Wireless Communications. Proceedings of the IEEE, 90 (2), 187-219.

Record type: Article

Abstract

Following a brief historical perspective on channel coding, an introduction to space–time block codes is given. The various space–time codes considered are then concatenated with a range of channel codecs, such as convolutional and block-based turbo codes as well as conventional and turbo trellis codes. The associated estimated complexity issues and memory requirements are also considered. These discussions are followed by a performance study of various space–time and channel-coded transceivers. Our aim is first to identify a space–time code/channel code combination constituting a good engineering tradeoff in terms of its effective throughput, bit-error-rate performance, and estimated complexity. Specifically, the issue of bit-to-symbol mapping is addressed in the context of convolutional codes (CCs) and convolutional coding as well as Bose–Chaudhuri–Hocquenghem coding-based turbo codes in conjunction with an attractive unity-rate space–time code and multilevel modulation is detailed. It is concluded that over the nondispersive or narrow-band fading channels, the best performance versus complexity tradeoff is constituted by Alamouti’s twin-antenna block space–time code concatenated with turbo convolutional codes. Further comparisons with space–time trellis codes result in similar conclusions. Keywords—Channel coding, concatenated coding, FEC, history of channel coding, space–time coding, STBC, STTC.

Text
thl-lh-procieee-feb-2002.pdf - Other
Download (911kB)

More information

Published date: February 2002
Additional Information: 3 parts
Organisations: Southampton Wireless Group

Identifiers

Local EPrints ID: 257053
URI: http://eprints.soton.ac.uk/id/eprint/257053
ISSN: 0018-9219
PURE UUID: f0fa88de-402a-48ad-80cd-592a5e2cb8a4
ORCID for Lajos Hanzo: ORCID iD orcid.org/0000-0002-2636-5214

Catalogue record

Date deposited: 26 Jun 2003
Last modified: 24 Apr 2020 00:24

Export record

Contributors

Author: T.H. Liew
Author: Lajos Hanzo ORCID iD

University divisions

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.

×