Abstract
This paper presents an optimization approach to single-bit quantization. The paper starts by redefining single-bit quantization as a maximum-likelihood sequence detection problem and by showing that the Viterbi algorithm is its optimal solution. It also shows that the conventional ?? converter implements a greedy solution to the same optimization problem. There is, moreover, a continuum of solutions with different degrees of complexity between the ??s and the Viterbi solution. The paper details one such intermediate-complexity solution (based on the M-algorithm) and demonstrates that with an appropriate noise shaping filter it achieves a performance very close to the optimal Viterbi solution. The paper concludes by presenting two procedures for designing effective noise shaping filters.
Sign-in/Register to access full text options 
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 callMore From: IEEE Transactions on Circuits and Systems I: Regular Papers
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.
