The University of Southampton
University of Southampton Institutional Repository

Primitive polynomials for iterative recursive soft sequential acquisition of concatenated sequences

Primitive polynomials for iterative recursive soft sequential acquisition of concatenated sequences
Primitive polynomials for iterative recursive soft sequential acquisition of concatenated sequences

An iterative initial sequence acquisition technique is proposed for the pseudo-noise signal derived from a pair of m -sequences used for generating the concatenated sequence, which relies on the soft-in-soft-out detection to improve the acquisition performance. This recursive soft sequential estimation technique has a linearly increasing complexity with the number of chips in the concatenated sequence. Receiving as few as S consecutive chips of a (2 S -1)-chip sequence is sufficient for the local concatenated-sequence generator of the receiver to synchronize. Hence, this initial synchronization technique is eminently suitable for long m -sequences and concatenated sequences. Another key result is the comparison of m -sequences and concatenated sequences regarding the acquisition time. It is also observed that low-order primitive polynomials (PPs) achieve better performances than higher-order polynomials for both the m -sequences and concatenated sequences. When considering PPs having a higher number of taps, the exploitation of concatenated sequences is capable of achieving in excess of 3-dB signal-to-noise ratio gains over m -sequences.

acquisition time (AT), concatenated sequence, EXIT chart, m-sequence, pseudo-noise (PN), Recursive soft sequential estimation (RSSE)
2169-3536
13882-13900
Ahmed, Abbas
8b36aae0-dcc6-4cb7-8dc6-2e0f84d54e06
Botsinis, Panagiotis
d7927fb0-95ca-4969-9f8c-1c0455524a1f
Won, Seunghwan
2b55c878-6faf-48f5-98e5-64342b58af53
Yang, Lie Liang
ae425648-d9a3-4b7d-8abd-b3cfea375bc7
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1
Ahmed, Abbas
8b36aae0-dcc6-4cb7-8dc6-2e0f84d54e06
Botsinis, Panagiotis
d7927fb0-95ca-4969-9f8c-1c0455524a1f
Won, Seunghwan
2b55c878-6faf-48f5-98e5-64342b58af53
Yang, Lie Liang
ae425648-d9a3-4b7d-8abd-b3cfea375bc7
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1

Ahmed, Abbas, Botsinis, Panagiotis, Won, Seunghwan, Yang, Lie Liang and Hanzo, Lajos (2019) Primitive polynomials for iterative recursive soft sequential acquisition of concatenated sequences. IEEE Access, 7, 13882-13900. (doi:10.1109/ACCESS.2019.2892375).

Record type: Article

Abstract

An iterative initial sequence acquisition technique is proposed for the pseudo-noise signal derived from a pair of m -sequences used for generating the concatenated sequence, which relies on the soft-in-soft-out detection to improve the acquisition performance. This recursive soft sequential estimation technique has a linearly increasing complexity with the number of chips in the concatenated sequence. Receiving as few as S consecutive chips of a (2 S -1)-chip sequence is sufficient for the local concatenated-sequence generator of the receiver to synchronize. Hence, this initial synchronization technique is eminently suitable for long m -sequences and concatenated sequences. Another key result is the comparison of m -sequences and concatenated sequences regarding the acquisition time. It is also observed that low-order primitive polynomials (PPs) achieve better performances than higher-order polynomials for both the m -sequences and concatenated sequences. When considering PPs having a higher number of taps, the exploitation of concatenated sequences is capable of achieving in excess of 3-dB signal-to-noise ratio gains over m -sequences.

Text
08610079 - Version of Record
Available under License Creative Commons Attribution.
Download (3MB)

More information

Accepted/In Press date: 11 December 2018
e-pub ahead of print date: 11 January 2019
Keywords: acquisition time (AT), concatenated sequence, EXIT chart, m-sequence, pseudo-noise (PN), Recursive soft sequential estimation (RSSE)

Identifiers

Local EPrints ID: 428594
URI: https://eprints.soton.ac.uk/id/eprint/428594
ISSN: 2169-3536
PURE UUID: fbfc4cd5-d7ee-4d42-9dfd-90c25b252d42
ORCID for Lie Liang Yang: ORCID iD orcid.org/0000-0002-2032-9327
ORCID for Lajos Hanzo: ORCID iD orcid.org/0000-0002-2636-5214

Catalogue record

Date deposited: 04 Mar 2019 17:30
Last modified: 14 Mar 2019 01:55

Export record

Altmetrics

Contributors

Author: Abbas Ahmed
Author: Panagiotis Botsinis
Author: Seunghwan Won
Author: Lie Liang Yang ORCID iD
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 https://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.

×