Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Bandwidth efficient signaling requires using pulse-shaping that inherently has intersymbol interference (ISI) except when the timing is perfect. Several lor bounds to the mean-square-error (MSE) of non-data-aided bit-synchronizers are derived for this case. The optimal lor bound is derived using the maximum likelihood (ML) criterion for a sequence of binary pulse amplitude modulated pulses in the presence of ISI and Gaussian noise. This lor bound is used as a benchmark to evaluate the performance of other synchronizers in a practical scenario. It is shown that a previous lor bound based on the ISI-free ML synchronizer cannot be used to lor bound the MSE of bit-synchronizers. A detection theory bound (DTB) (also called Ziv-Zakai bound) is applied to the symbol timing recovery problem in the presence of ISI and it is shown that this bound is a tight lor bound on the MSE of the ML synchronizer. A simple lor bound on this DTB is derived and it is shown that the simple bound is almost as tight as the ll known modified Cramer-Rao bound (MCRB) at moderate values of SNR, while it does not suffer from the shortcomings of the MCRB at small values of SNR.
['Amin Emad', 'Norman C. Beaulieu']
I am writing a research paper on a idea Lower Bounds to the Performance of Bit Synchronization for Bandwidth Efficient Pulse-Shaping
[{"from": "human", "value": "I am writing a research paper on a idea Lower Bounds to the Performance of Bit Synchronization for Bandwidth Efficient Pulse-Shaping"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Bandwidth efficient signaling requires using pulse-shaping that inherently has intersymbol interference (ISI) except when the timing is perfect. Several lor bounds to the mean-square-error (MSE) of non-data-aided bit-synchronizers are derived for this case. The optimal lor bound is derived using the maximum likelihood (ML) criterion for a sequence of binary pulse amplitude modulated pulses in the presence of ISI and Gaussian noise. This lor bound is used as a benchmark to evaluate the performance of other synchronizers in a practical scenario. It is shown that a previous lor bound based on the ISI-free ML synchronizer cannot be used to lor bound the MSE of bit-synchronizers. A detection theory bound (DTB) (also called Ziv-Zakai bound) is applied to the symbol timing recovery problem in the presence of ISI and it is shown that this bound is a tight lor bound on the MSE of the ML synchronizer. A simple lor bound on this DTB is derived and it is shown that the simple bound is almost as tight as the ll known modified Cramer-Rao bound (MCRB) at moderate values of SNR, while it does not suffer from the shortcomings of the MCRB at small values of SNR."}]