Reduced complexity per-survivor iterative timing recovery using max-log-MAP algorithm
by Chuan Hsian Pu; Ezra Morris Abraham Gnanamuthu; Fook Loong Lo; Mau-Luen Tham
International Journal of Information and Communication Technology (IJICT), Vol. 17, No. 2, 2020

Abstract: In this paper, we propose a reduced complexity (RC) per-survivor-processing (RC-PSP) iterative timing recovery scheme. The objective is to lessen the computational burden while approaching the optimal system performance of the existing full-complexity (FC) log-MAP (FC-PSP) iterative recovery scheme. This is achieved by utilising the max-log-MAP framework, which converts the multiplications and additions to maximum operations. According to Spasov, Gushev and Ristov, such framework consumes less power, reduces space on a chip and increases decoding speed. Robertson et al. showed that max-log-MAP PSP requires only 5 × 2^M − 2 max operations, 10 × 2^M additions and 8 multiplications by ±1. Furthermore, it offers a direct mathematical framework for converting the log-MAP-based PSP to max-log-MAP-based PSP for timing recovery. The simulations show that the proposed method outperforms the previous methods. The computational complexity for the max-log-MAP PSP is significantly reduced at the cost of a small bit error rate (BER) performance loss.

Online publication date: Tue, 11-Aug-2020

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information and Communication Technology (IJICT):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com