Lower Bounds to the Performance of Bit Synchronization for Bandwidth Efficient Pulse-Shaping

Bandwidth efficient signaling requires using pulse-shaping that inherently has intersymbol interference (ISI) except when the timing is perfect. Several lower bounds to the mean-square-error (MSE) of non-data-aided bit-synchronizers are derived for this case. The optimal lower bound is derived using...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on communications Vol. 58; no. 10; pp. 2789 - 2794
Main Authors:	Emad, A, Beaulieu, N C
Format:	Journal Article
Language:	English
Published:	New York, NY IEEE 01.10.2010 Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithms Applied sciences Bandwidth Benchmarking Bit synchronizer Cramer-Rao bound Cramer-Rao bounds detection theory bound Equations Exact sciences and technology Gaussian Heuristic intersymbol interference Lower bounds Mathematical model non-data-aided synchronization Optimization Pulse amplitude Random variables Signal to noise ratio Studies Switching and signalling Synchronization Synchronizers Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Time measurements Transmission and modulation (techniques and equipments) zero-crossing synchronizer Ziv-Zakai bound Performance evaluation non-data-aided synchronization Pulse shaping Ziv-Zakai bound Zero crossing Mean square error Gaussian noise Binary modulation Detection limit Pulse amplitude modulation Cramer Rao inequality Pulse sequence Lower bound Cramer-Rao bound zero-crossing synchronizer Signalling Synchronization Clock recovery Symbol manipulation Intersymbol interference Bit synchronizer detection theory bound Maximum likelihood Timing Signal to noise ratio
ISSN:	0090-6778, 1558-0857
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!