Abstract
In a previous paper a series expansion method for calculating the error probability of a binary digital AM system in the presence of intersymbol interference and additive gaussian noise was derived. <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sup> In this paper those results are extended to the multilevel case. In the examples calculated for a four-level system, this method is 10 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">4</sup> times faster than the exhaustive method and is 10 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> times more accurate than the Chernoff bound. The actual computation time with an 11-sample approximation to the real system impulse response is only 1.3 seconds with the GE Mark II time-sharing system.
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.
