Abstract

A Complete formal solution of the Wiener approximation problem in the absence of noise is given for the case when the input is a ternary or an inverse-repeat binary m sequence. The full set of correlation equations are shown to depend on N/2 1st-order and N/2 2nd-order equations, where N is the sequence period; for the ternary sequence, the proof makes use of a new identity in the elements 0, 1, −1. It is concluded that these sequences do not effectively identify kernels of order greater than 2.

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 call

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.