Open AccessCarrier synchronisation for multiple symbol Trellis‐coded CPFSK in burst‐mode transmission
Author(s) -
Si Jiangbo,
Mu Yanhong,
Li Zan,
Wang Yang,
Zhai Wenchao,
Huang Haiyan
Publication year - 2017
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2016.0541
Subject(s) - phase locked loop , trellis (graph) , computer science , transmission (telecommunications) , waveform , frequency shift keying , algorithm , modulation (music) , synchronization (alternating current) , continuous phase modulation , phase shift keying , demodulation , quadrature amplitude modulation , control theory (sociology) , electronic engineering , telecommunications , bit error rate , decoding methods , channel (broadcasting) , engineering , physics , radar , control (management) , artificial intelligence , acoustics , jitter
A carrier synchronisation technique for multiple symbol Trellis‐coded continuous phase frequency shift keying (MSTC‐CPFSK) system in burst‐mode transmission is proposed. For the synchronisation technique, a joint data‐aided (DA) acquisition and phase‐locked loop (PLL) tracking algorithm is presented. First, an all‐zero sequence is utilised as a pilot for DA acquisition, where the modulated pilot waveform is a direct current (DC) signal, eliminating the operation of modulation removal; and then, a second‐order PLL structure is introduced for tracking processing, and we make an analysis of the tracking performance by calculating the equivalent Cramer–Rao bound (ECRB) for the second‐order PLL structure; subsequently, we extend the obtained result to any order PLL structures; moreover, the ECRB for the MSTC‐CPFSK system is also derived through arithmetical calculation; finally, some numerical results are given to verify the performance of the authors presented synchronisation algorithm, and the simulations illustrate that their algorithm can improve the throughput compared with the classical DA‐only algorithm.