Abstract
The upper bound derived by Verdu (1986) is often used to evaluate the bit error performance of both the maximum-likelihood (ML) sequence detector for single-user systems and the ML multiuser detector for code-division multiple-access (CDMA) systems. This upper bound, which is based on the concept of indecomposable error vectors (IEVs), can be expensive to compute because in general the IEVs may only be obtained using an exhaustive search. We consider the identification of IEVs for a particular class of ML detection problems commonly encountered in communications. By exploiting the properties of the IEVs for this case, we develop an IEV generation algorithm which has a complexity substantially lower than that of the exhaustive search. We also show that for specific communication systems, such as duobinary signaling, the expressions of Verdu's upper bound can be considerably simplified.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
