Determination of the minimum sampling frequency in bandpass sampling by geometric approach and geometric programming

Original Paper
  • 45 Downloads

Abstract

This paper presents a simple and fast approach to find a minimum sampling frequency for multi-band signals. Instead of neighbor and boundary conditions, constraints on the sampling frequency were derived by using the geometric approach to the bandpass sampling theorem. Reformulation of the constraints on the minimum sampling frequency enabled to represent the problem as an optimization problem which was structured by the geometric programming and mixed-integer nonlinear programming methods. The convex optimization problem was then solved by the proposed algorithm applying interior point approach in the line search framework. It was demonstrated that this unified structure directly linked the geometric approach of the bandpass sampling theorem to the optimization problem. The proposed method was verified through numerical simulations in terms of the minimum sampling frequency and the computational efficiency. Results illustrated the feasibility of the geometric approach and the proposed algorithm in the determination of the minimum sampling frequency by providing the savings in the number of iterations and the decrease in the valid minimum sampling frequency.

Keywords

Bandpass sampling Multi-band signals Geometry of sampling Nonlinear optimization algorithms 

Notes

Acknowledgements

The author would like to thank Prof. Dr. Aydin Akan and Prof. Dr. Tulin Aktin for their guidance and constant support in completing the project.

References

  1. 1.
    Lin, Y.P., Liu, Y.D., Phoong, S.M.: A new iterative algorithm for finding the minimum sampling frequency for multiband signals. IEEE Trans. Signal Process. 58, 5446–5450 (2010)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Bose, S., Khaitan, V., Chaturvedi, A.: A low-cost algorithm to find the minimum sampling frequency for multiple bandpass signals. IEEE Signal Process. Lett. 15, 877–880 (2008)CrossRefGoogle Scholar
  3. 3.
    Liu, J.C.: Complex bandpass sampling and direct downconversion of multiband analytic signals. Signal Process. 90, 504–512 (2010)CrossRefMATHGoogle Scholar
  4. 4.
    Bae, J., Park, J.: An efficient algorithm for bandpass sampling of multiple RF signals. IEEE Signal Process. Lett. 13, 193–196 (2006)CrossRefGoogle Scholar
  5. 5.
    Tseng, C.H., Chou, S.C.: Direct downconversion of multiband RF signals using bandpass sampling. IEEE Trans. Wirel. Commun. 5, 72–76 (2006)CrossRefGoogle Scholar
  6. 6.
    Ahmed, T., Khan, N.M.: Direct radio frequency sampling methodology for multiple signals in an energy-sparse spectrum. Turk. J. Electr. Eng. Comput. Sci. 24, 4637–4647 (2016)CrossRefGoogle Scholar
  7. 7.
    Wang, H., Deng, Y., Dong, B., Yang, L., Yao, Z., Su, D.: A multiband RF signal sampling frequency selection method based on cylindrical surface spectrum analysis. EURASIP J. Wirel. Commun. (2016).  https://doi.org/10.1186/s13638-016-0783-1 Google Scholar
  8. 8.
    Boute, R.: The geometry of bandpass sampling: a simple and safe approach. IEEE Signal Process. Mag. 90, 1–7 (2012)Google Scholar
  9. 9.
    Vaughan, R.G., Scott, N.L., White, D.R.: The theory of bandpass sampling. IEEE Trans. Signal Process. 39, 1973–1984 (1991)CrossRefGoogle Scholar
  10. 10.
    Wei, D., Ran, Q., Li, Y.: Sampling of bandlimited signals in the linear canonical transform domain. SIVIP 7, 553–558 (2013)CrossRefGoogle Scholar
  11. 11.
    Rao, S.S.: Geometric Programming, Engineering Optimization: Theory and Practice, 4th edn. Wiley, New York (2009)CrossRefGoogle Scholar
  12. 12.
    Benson, H.Y.: Using interior-point methods within an outer approximation framework for mixed integer nonlinear programming. In: Leyffer, L.J. (ed.) Mixed Integer Nonlinear Programming. The IMA Volumes in Mathematics and Its Applications, pp. 225–243. Springer, New York (2012)CrossRefGoogle Scholar
  13. 13.
    Wachter, A., Biegler, L.T.: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Program. 106, 25–57 (2006)MathSciNetCrossRefMATHGoogle Scholar
  14. 14.
    Benson, H.Y., Shanno, D., Vanderbei, R.: Interior-point methods for nonconvex nonlinear programming. Comput. Optim. Appl. 23, 257–272 (2002)MathSciNetCrossRefMATHGoogle Scholar
  15. 15.
    Benson, H.Y., Shanno, D.: An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming. Comput. Optim. Appl. 38, 371–399 (2007)MathSciNetCrossRefMATHGoogle Scholar
  16. 16.
    Venkataramani, R., Bresler, Y.: Optimal sub-Nyquist nonuniform sampling and reconstruction for multiband signals. IEEE Trans. Signal Process. 49, 2301–2313 (2001)CrossRefGoogle Scholar
  17. 17.
    Lyons, R.G.: Understanding Digital Signal Processing, 3rd edn. Prentice Hall, Upper Saddle River (2011)Google Scholar
  18. 18.
    Boyd, S., Kim, S.J., Vandenberghe, L., Hassibi, A.: A tutorial on geometric programming. Optim. Eng. 8, 67–127 (2007)MathSciNetCrossRefMATHGoogle Scholar
  19. 19.
    Chiang, M.: Geometric programming for communication systems. Found. Trends 2, 1–154 (2005).  https://doi.org/10.1561/0100000005 MATHGoogle Scholar
  20. 20.
    Mattingle, J., Boyd, S.: Real-time convex optimization in signal processing. IEEE Signal Process. Mag. 8, 50–61 (2010)CrossRefGoogle Scholar
  21. 21.
    Gertz, M., Nocedal, J., Sartenar, A.: Starting point strategy for nonlinear interior methods. Appl. Math. Lett. 17, 945–952 (2004)MathSciNetCrossRefMATHGoogle Scholar
  22. 22.
    Nocedal, J., Wright, S.J.: Numerical Optimization, 2nd edn. Springer, New York (2006)MATHGoogle Scholar

Copyright information

© Springer-Verlag London Ltd., part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of Electrical-Electronics EngineeringIstanbul Kultur UniversityBakirkoy, IstanbulTurkey

Personalised recommendations