Abstract
The cyclic A/D converting process is equivalent to iterations of a chaotic may using symbolic dynamics. The principle can be extended to construct "general cyclic ADCs" based on chaotic iterations. In this paper, the two necessary conditions of iterated maps are presented, and the new attributes of these converters are also discussed. By establishing a noise model, the analytic expressions of the random and system errors in general cyclic ADCs are derived and verified by simulations. With the same level of additive white noise, the optimal iterative maps for general cyclic ADCs are deduced.
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.
