Abstract
A general procedure is developed to implement the fixed delay tree search (FDTS) detector in the multi-dimensional signal space. The procedure systematically finds a required set of hyperplanes that divide the entire space into different decision regions. A Boolean mapping function is also analytically determined which generates a final binary decision from several intermediate binary variables that indicate the position of the observation vector relative to given hyperplanes. The proposed technique is demonstrated on a (1+D)/sup 2/ partial response channel driven by the (1,k)-coded input.
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.
