1 / 24

An Iterative Algorithm for Finding the Minimum Sampling Frequency For Two Bandpass Signals

This paper presents an innovative iterative algorithm designed to determine the minimum sampling frequency for two bandpass signals. It addresses the challenges posed by aliasing in signal processing through a novel set of alias-free sampling conditions. The study reviews previous works in this field, formulates the problem comprehensively, and evaluates the proposed algorithm's efficiency and complexity. By conducting simulations and comparisons, the authors demonstrate the algorithm's effectiveness, paving the way for enhanced sampling techniques in telecommunications and signal processing applications.

astrid
Télécharger la présentation

An Iterative Algorithm for Finding the Minimum Sampling Frequency For Two Bandpass Signals

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. An Iterative Algorithm for Finding the Minimum Sampling Frequency For Two Bandpass Signals Yuan-Pei Lin, Yi-De Liu, See-May Phoong

  2. Outline • Problem Formulation • Previous Works • A New Set of Conditions for Alias-Free Sampling • The Proposed Iterative Algorithm • Complexity • Simulations and Comparisons • Conclusion

  3. Problem Formulation

  4. Previous Works:One-bandpass (2 bands) Case

  5. Previous Works

  6. The Proposed Algorithm

  7. A New Set of Alias-Free Sampling Conditions

  8. Case (a)

  9. Case (a)

  10. Case (b)

  11. Case (c)

  12. Case (c)

  13. Case (c)

  14. Case (d)

  15. Alias-Free Sampling Conditions

  16. Meeting the Alias-Free Sampling Conditions

  17. Meeting the Condition for Case (a) – (1)

  18. Meeting the Condition for Case (a) – (2)

  19. Proposed Iterative Algorithm

  20. Iterative Algorithm

  21. Complexity

  22. Simulation and Comparison

  23. Simulation and Comparison

  24. Conclusions

More Related