Abstract
Binary symbol detection based on a sequence of finite observation signals is formulated in the multidimensional signal space. A systematic space partitioning method is proposed to divide the entire space into two decision regions using a set of hyperplanes. The resulting detector structure consists of K parallel linear classifiers followed by a K-to-1 Boolean mapper, and is well suited to high-speed implementation. Compared to direct implementation of the fixed-delay tree search (FDTS) detection rule, the proposed signal-space formulation results in a considerable saving in digital hardware. Examples taken from binary-input intersymbol interference (ISI) channels are used to demonstrate the proposed technique. Block processing strategies suitable for high-speed applications are also discussed.
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.
