Abstract
Problem statement. At that moment, it is relevant to create algorithms for communication channels capacity estimation within the framework of the Theory of Resolution Time for broadband wired telecommunication systems, which use bipolar PAM-n-signal whose execution time complexity is linear. The creation of such algorithms is of high importance both for wired network technologies (Ethernet, InfiniBand etc), and in the field of creating high-speed interchip connections, high-speed memory controllers and peripheral computer buses, since it will allow to improve channel capacity at low computational costs in real-time regime due to the transition to the “above Nyquist speed” regime. Target. Develop an algorithm which has linear computational complexity in the framework of The Resolution Time Theory for frequency-selective communication channels capacity estimation with a linear receiver and PAM-n-signal. Results. An algorithm for estimating specific channel capacity and resolution time is presented, which has linear computational complexity, depending only on the value of the effective memory, for continuous frequency-selective communication channels with a discrete source, in which information is transmitted utilizing bipolar PAM-n-signal. This algorithm has no restrictions on the pulse shape, and the computational complexity linearly depends on the channel memory. The key features of the algorithm are considered, allowing its application in real time. The developed algorithm allows to user fully estimate all the effects caused by data depended jitter. Practical significance. The proposed algorithm makes it possible in real time to select the shape of a partial pulse and the configuration of the signal constellation that increase the specific capacity of a communication system with serial data transmission, including under conditions of transmission in the “Faster than Nyquist” regime.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.