Abstract
We present an efficient algorithm to compute the distance spectrum of a general finite intersymbol interference (ISI) channel, whose complexity is lower than those of existing methods. Closed-form expressions are derived for both input-output Euclidean distance enumerators and asymptotic distance spectrum shapes for 2-tap and 3-tap ISI channels. Coded and/or precoded ISI channels are also discussed.
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.
