A New Frame Synchronization Algorithm for Linear Periodic Channels With Memory
Identifying the start time of a sequence of symbols received at the receiver, commonly referred to as frame synchronization, is a critical task for achieving good performance in digital communications systems employing time-multiplexed transmission. In this work we focus on frame synchronization for...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2020-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9139959/ |
id |
doaj-1b4d27068a944f21953eef20900e77f8 |
---|---|
record_format |
Article |
spelling |
doaj-1b4d27068a944f21953eef20900e77f82021-03-30T04:39:45ZengIEEEIEEE Access2169-35362020-01-01813343013345010.1109/ACCESS.2020.30091319139959A New Frame Synchronization Algorithm for Linear Periodic Channels With MemoryOren Kolaman0https://orcid.org/0000-0003-3666-3570Ron Dabora1https://orcid.org/0000-0001-8486-1243Department of Electrical and Computer Engineering, Ben-Gurion University of the Negev, Be’er Sheva, IsraelDepartment of Electrical and Computer Engineering, Ben-Gurion University of the Negev, Be’er Sheva, IsraelIdentifying the start time of a sequence of symbols received at the receiver, commonly referred to as frame synchronization, is a critical task for achieving good performance in digital communications systems employing time-multiplexed transmission. In this work we focus on frame synchronization for linear channels with memory, in which the channel impulse response is periodic and the additive Gaussian noise is correlated and cyclostationary. Such channels appear in many communications scenarios, including narrowband power line communications and interference-limited wireless communications. We derive frame synchronization algorithms based on simplifications of the optimal likelihood-ratio test, assuming the channel impulse response is unknown at the receiver, which is applicable to many practical scenarios. The computational complexity of each of the derived algorithms is characterized, and a procedure for selecting nearly optimal synchronization sequences is proposed. The algorithms derived in this work achieve better performance than the noncoherent correlation detector, and, in fact, facilitate a controlled tradeoff between complexity and performance.https://ieeexplore.ieee.org/document/9139959/Frame synchronizationcyclostationary signalslinear periodically time-varying channelsCMA equalizerhypothesis testinglikelihood ratio test |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Oren Kolaman Ron Dabora |
spellingShingle |
Oren Kolaman Ron Dabora A New Frame Synchronization Algorithm for Linear Periodic Channels With Memory IEEE Access Frame synchronization cyclostationary signals linear periodically time-varying channels CMA equalizer hypothesis testing likelihood ratio test |
author_facet |
Oren Kolaman Ron Dabora |
author_sort |
Oren Kolaman |
title |
A New Frame Synchronization Algorithm for Linear Periodic Channels With Memory |
title_short |
A New Frame Synchronization Algorithm for Linear Periodic Channels With Memory |
title_full |
A New Frame Synchronization Algorithm for Linear Periodic Channels With Memory |
title_fullStr |
A New Frame Synchronization Algorithm for Linear Periodic Channels With Memory |
title_full_unstemmed |
A New Frame Synchronization Algorithm for Linear Periodic Channels With Memory |
title_sort |
new frame synchronization algorithm for linear periodic channels with memory |
publisher |
IEEE |
series |
IEEE Access |
issn |
2169-3536 |
publishDate |
2020-01-01 |
description |
Identifying the start time of a sequence of symbols received at the receiver, commonly referred to as frame synchronization, is a critical task for achieving good performance in digital communications systems employing time-multiplexed transmission. In this work we focus on frame synchronization for linear channels with memory, in which the channel impulse response is periodic and the additive Gaussian noise is correlated and cyclostationary. Such channels appear in many communications scenarios, including narrowband power line communications and interference-limited wireless communications. We derive frame synchronization algorithms based on simplifications of the optimal likelihood-ratio test, assuming the channel impulse response is unknown at the receiver, which is applicable to many practical scenarios. The computational complexity of each of the derived algorithms is characterized, and a procedure for selecting nearly optimal synchronization sequences is proposed. The algorithms derived in this work achieve better performance than the noncoherent correlation detector, and, in fact, facilitate a controlled tradeoff between complexity and performance. |
topic |
Frame synchronization cyclostationary signals linear periodically time-varying channels CMA equalizer hypothesis testing likelihood ratio test |
url |
https://ieeexplore.ieee.org/document/9139959/ |
work_keys_str_mv |
AT orenkolaman anewframesynchronizationalgorithmforlinearperiodicchannelswithmemory AT rondabora anewframesynchronizationalgorithmforlinearperiodicchannelswithmemory AT orenkolaman newframesynchronizationalgorithmforlinearperiodicchannelswithmemory AT rondabora newframesynchronizationalgorithmforlinearperiodicchannelswithmemory |
_version_ |
1724181404738125824 |