Sub–Nyquist Frequency Efficient Audio Compression

Abstract

This paper presents the application of a framework of fast and efficient compressive sampling based on the concept of random sampling of sparse Audio signal. It provides four important features. (i) It is universal with a variety of sparse signals. (ii) The number of measurements required for exact reconstruction is nearly optimal and much less then the sampling frequency and below the Nyquist frequency. (iii) It has very low complexity and fast computation. (iv) It is developed on the provable mathematical model from which we are able to quantify trade-offs among streaming capability, computation/memory requirement and quality of reconstruction of the audio signal. Compressed sensing CS is an attractive compression scheme due to its universality and lack of complexity on the sensor side. In this paper a study of applying compressed sensing on audio signals was presented. The performance of different bases and its reconstruction are investigated, as well as exploring its performance. Simulations results are present to show the efficient reconstruction of sparse audio signal. The results shows that compressed sensing can dramatically reduce the number of samples below the Nyquist rate keeping with a good PSNR.

Keywords

• Sub-Nyquist Sampling
• Compressive Sampling
• Compressed Sensing
• Nonlinear Reconstruction
• Random Matrices.