Abstract
We consider the transmission of a discrete data sequence via a communication channel that is subject to (additive) noise with a known upper bound on its magnitude but otherwise completely unrestricted behaviour. We provide a general recursive algorithm that can be used at the receiving end to perfectly reconstruct the transmitted sequence (possibly with some delay) when the existing necessary and sufficient conditions for perfect reconstruction hold, or to obtain all valid sequences that are consistent with the received sequence when the perfect reconstruction condition is violated. We also discuss the memory and computational requirements for the proposed algorithm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Systems, Control and Communications
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.