Abstract
The computation of upper and lower bounds to error probability in digital transmission over nonlinear channels with a finite memory is considered. By using orthogonal Volterra series, the authors derive a canonical representation for discrete nonlinear systems, based on a linear convolutional code and a memoryless mapper. This representation shows that finite-memory, discrete nonlinear systems can be analyzed in much the same way as TCM (trellis-coded modulation) schemes. In particular, TCM over nonlinear channels can be analyzed. A technique is derived that expresses an upper bound to error probability based on the computation of the transfer of a state diagram with N branches, and whose branch labels are matrices rather than scalars. Some examples of its application are given. In particular, error bounds are derived for nonlinear TCM schemes and for TCM schemes operating on nonlinear channels.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
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.
