The University of Southampton
University of Southampton Institutional Repository

Block-based precoding for serially concatenated codes

Block-based precoding for serially concatenated codes
Block-based precoding for serially concatenated codes
Precoders have been shown to facilitate iterative decoding convergence towards the Maximum Likelihood (ML) performance in serially concatenated schemes. In this letter, we propose a novel block-based precoder as an alternative to classic convolutional precoders. Furthermore, we demonstrate that the proposed block-based precoder facilitates operation at significantly reduced channel Signal to Noise Ratios (SNRs) in practical schemes, having limited latencies, as well as limited implementational and computational decoding complexities.
precoding, repetition code, iterative decoding, fixed length code, FLC, modulation, check code, EXIT chart, computational complexity
794-796
Maunder, R. G.
76099323-7d58-4732-a98f-22a662ccba6c
Hanzo, L.
66e7266f-3066-4fc0-8391-e000acce71a1
Maunder, R. G.
76099323-7d58-4732-a98f-22a662ccba6c
Hanzo, L.
66e7266f-3066-4fc0-8391-e000acce71a1

Maunder, R. G. and Hanzo, L. (2009) Block-based precoding for serially concatenated codes IEEE Communications Letters, 13, (10), pp. 794-796.

Record type: Article

Abstract

Precoders have been shown to facilitate iterative decoding convergence towards the Maximum Likelihood (ML) performance in serially concatenated schemes. In this letter, we propose a novel block-based precoder as an alternative to classic convolutional precoders. Furthermore, we demonstrate that the proposed block-based precoder facilitates operation at significantly reduced channel Signal to Noise Ratios (SNRs) in practical schemes, having limited latencies, as well as limited implementational and computational decoding complexities.

PDF bbpfscc2.pdf - Other
Download (60kB)
PDF BBPFSCC.pdf - Accepted Manuscript
Download (180kB)

More information

Published date: October 2009
Keywords: precoding, repetition code, iterative decoding, fixed length code, FLC, modulation, check code, EXIT chart, computational complexity
Organisations: Southampton Wireless Group

Identifiers

Local EPrints ID: 267463
URI: http://eprints.soton.ac.uk/id/eprint/267463
PURE UUID: 7d8b93bc-d44e-4828-a971-026c5767c679
ORCID for R. G. Maunder: ORCID iD orcid.org/0000-0002-7944-2615
ORCID for L. Hanzo: ORCID iD orcid.org/0000-0002-2636-5214

Catalogue record

Date deposited: 04 Jun 2009 12:35
Last modified: 18 Jul 2017 07:04

Export record

Contributors

Author: R. G. Maunder ORCID iD
Author: L. 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.

×