<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Implementation of Audio Compression using Wavelet</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Hauwa T. Abdulkarim</string-name>
          <email>talatuabdulk@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Tijjani S. Abdulrahman</string-name>
          <email>teejays1569@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Abubakar S. Mohammed</string-name>
          <email>abussadiq@yahoo.com</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of, Electrical/Electronic, Technology, College of</institution>
          ,
          <addr-line>Education, Minna</addr-line>
          ,
          <country country="NG">Nigeria</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Dept. of Electrical/Electronic, Engineering, Federal University, of Technology</institution>
          ,
          <addr-line>Minna</addr-line>
          ,
          <country country="NG">Nigeria</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2016</year>
      </pub-date>
      <fpage>7</fpage>
      <lpage>9</lpage>
      <abstract>
        <p>The need to transmit audio signal has increased tremendously over the past decade. In view of this, audio compression is a sure technology of the multimedia age which facilitates ease of transmission. The change in the telecommunication infrastructure, in recent years, from circuit switched to packet switched systems has also reflected on the way that speech and audio signals are carried in present systems. In many applications, such as the design of multimedia workstations and high quality audio transmission and storage, the goal of audio compression is to encode audio data to take up less storage space and less bandwidth for ease of transmission. This paper presents the implementation of audio compression using wavelet. The implementation procedure, the Matlab code and the results obtained are duly presented and discussed. The final results indicate that a good reconstruction was performed and the performance of the wavelet was excellent with the performance variables all in the region well above 60%. • Hardware ➝ Communication hardware, interfaces and storage ➝ Signal processing systems ➝ Digital Signal Processing Figure 1: Plot of Original Signal</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. INTRODUCTION</title>
      <p>Audio compression- a popular 21st century technique enables the
substantial data rates associated with uncompressed digital audio
signal to be efficiently stored and transmitted [Bowman et al.,
1993]. In this modern day, sounds of telephone, television, radios
etc. undergo some form of compression or the other to improve
the quality of sound and ultimately reduce storage space and
bandwidth.</p>
      <p>The advancement in radio communication has geared up the
development of wireless multimedia sensor networks (WMSNs)
which can process multimedia data such as video and audio
streams, still images collected from the application area[Ding and
Marchionini 1997; Fröhlich and Plate 2000; Tavel 2007]. Energy
is one of the scarcest resources [Sannella 1994; Forman 2003] in
such networks and data compression is one of the implementing
techniques to save energy in these networks [Tavel 2007].
The increase in data transfer has led to the need to develop
appropriate signal processing techniques to handle audio and
video compression [Brown et al. 2003]. Many types of digital data
can be compressed in a way that reduces the size occupied on a
computer memory or the bandwidth needed to stream it with no of
the full information in the original signal. Audio compression can
be achieved by either lossless compression (in which all the
information from the original signal is recoverable) or by lossy
data compression (in which the original signal is permanently
changed by removing redundant information [Yu 2006].
Although, lossless compression would keep all the information of
the original signal unaltered, it has the limitation of compression
ratio of about 3:1 while with lossy compression algorithms, the
compression ratio can be as high as 12:1 or higher [Spector 1989].
Audio compression is very much employed in this computer age
where information can be sent over the internet and other
ways[Zhao and Shen 2010]. Obviously the presence or absence of
some details in a sound signal makes no difference to the user and
removing the details during compression is of advantage to
storage and bandwidth required and consequently maximizing the
compression efficiency.
2.</p>
    </sec>
    <sec id="sec-2">
      <title>METHODOLOGY</title>
    </sec>
    <sec id="sec-3">
      <title>2.1 Implementation</title>
      <p>The implementation of the audio compression experiment was
done using Matlab. An audio file „short_beethoven.wav‟ and
„plot_time_scale.m‟ were both downloaded into the Matlab
directory. The audio signal was loaded using a Matlab command
„wavread‟. This original signal was plotted in order to be able to
differentiate it with the compressed signal. Figure 1 shows the
original signal.
Discrete Wave Transform (DWT) analysis was then performed
using the command [ca1,cd1]=dwt(s,'db3') which gives a
onelevel step decomposition sequentially. The three level
decomposition for both the approximate and detail coefficient
obtained are presented in The Matlab command „soundsc‟ was
used to listen to the decomposed signal and the effect of
decomposition was observed.</p>
      <p>After decomposition was complete the next was reconstruction of
all the details and approximations values from their coefficients
and levels of decomposition were done and the signal was
checked for errors to be sure a perfect reconstruction was done
before compression. Invert directly decomposition of the original
signal was then done and this was followed by reconstruction of
the original signal. The signal was compressed after inverse
discrete wave transform (IDWT).. Error (k) was determined
between the compressed and the original signal. The error in this
case was a value of
(
)
The error, k is a value which defines the deviation of the denoised
signal from the original. This value is small enough to assume the
deviation is negligible and this therefore implies that a near
perfect reconstruction was made.</p>
    </sec>
    <sec id="sec-4">
      <title>3. RESULTS AND DISCUSSION</title>
      <p>Figure 2 shows the plot of the original signal and the
approximation coefficient for three decomposition levels. „db3‟
was used for the 3-level decomposition, this is shown in Figure 3.
3.1 Compression and De-noising
‘ddencmp‟ Matlab command was used to automatically generate
the thresholding needed. The function also denoises and
compresses. Figure 6 presents the denoised and the original
signals for assessment and comparison. To the eye, the two
signals seem very identical although there are differences that
may not be detected with human eye. The signal was denoised
using global thresholding option applying the Matlab command
„wdencmp‟.
The Matlab code used for compressing the signal is
[thr,sorh,keepapp]=ddencmp('cmp','wv',s);
[sd,csd,lsd,perfo,perfl]=wdencmp('gbl',s,'db3',3,thr,sorh,keepapp)
;
„Perfo‟ and „perfl‟ are the variables which defines the
performance of the wavelet used for compression.‟perfo‟ indicates
the number of zeroed coefficients. For the present experiment a
68.0609% was obtained. This indicates that a good compression
can be achieved at least beyond 60%. 99.9915% was obtained for
„perfl‟ which indicates almost equal energy in the compressed
signal and the original signal. This implies that no data was loss as
a result of the compression.</p>
      <p>Plot_time_scale.m was used to plot the discrete transform in
colour.</p>
    </sec>
    <sec id="sec-5">
      <title>4. CONCLUSION</title>
      <p>Audio compression was implemented using wavelet. The
performance of the wavelet was excellent with „perfo‟=68.06%,
„perf12‟=99.9929%, and „perfl‟=99.9915%. This shows The
reconstruction was good as well since the error is negligible.
Audio compression is used for transmission and storage. The
compression is achieved by representing each sample of digitized
data by lesser number of bits and making it occupy lesser space
and consequently easy to transmit or store.</p>
    </sec>
    <sec id="sec-6">
      <title>5. ACKNOWLEDGMENTS</title>
      <p>The authors wish to thank Tertiary Education Trust Fund
(TETFund), Abuja, Nigeria and College of Education, Minna,
Nigeria for the sponsorship.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>Bowman</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Debray</surname>
            ,
            <given-names>S. K.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Peterson</surname>
            ,
            <given-names>L. L.</given-names>
          </string-name>
          <year>1993</year>
          .
          <article-title>Reasoning about naming systems</article-title>
          .
          <source>ACM Trans. Program. Lang. Syst</source>
          .
          <volume>15</volume>
          ,
          <issue>5</issue>
          (Nov.
          <year>1993</year>
          ),
          <fpage>795</fpage>
          -
          <lpage>825</lpage>
          . DOI= http://doi.acm.
          <source>org/10</source>
          .1145/161468.16147.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Brown</surname>
            ,
            <given-names>L. D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hua</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Gao</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <year>2003</year>
          .
          <article-title>A widget framework for augmented interaction in SCAPE</article-title>
          .
          <source>In Proceedings of the 16th Annual ACM Symposium on User Interface Software and Technology (Vancouver, Canada, November 02 - 05</source>
          ,
          <year>2003</year>
          ).
          <source>UIST '03. ACM</source>
          , New York, NY,
          <fpage>1</fpage>
          -
          <lpage>10</lpage>
          . DOI= http://doi.acm.
          <source>org/10</source>
          .1145/964696.964697
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>Ding</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Marchionini</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          <year>1997</year>
          .
          <article-title>A Study on Video Browsing Strategies</article-title>
          .
          <source>Technical Report</source>
          . University of Maryland at College Park.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>Forman</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          <year>2003</year>
          .
          <article-title>An extensive empirical study of feature selection metrics for text classification</article-title>
          .
          <source>J. Mach. Learn. Res</source>
          .
          <volume>3</volume>
          (
          <issue>Mar</issue>
          .
          <year>2003</year>
          ),
          <fpage>1289</fpage>
          -
          <lpage>1305</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>Fröhlich</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Plate</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <year>2000</year>
          .
          <article-title>The cubic mouse: a new device for three-dimensional input</article-title>
          .
          <source>In Proceedings of the SIGCHI Conference on Human Factors in Computing Systems (The Hague, The Netherlands, April 01 - 06</source>
          ,
          <year>2000</year>
          ).
          <source>CHI '00. ACM</source>
          , New York, NY,
          <fpage>526</fpage>
          -
          <lpage>531</lpage>
          . DOI= http://doi.acm.
          <source>org/10</source>
          .1145/332040.332491.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>Sannella</surname>
            ,
            <given-names>M. J.</given-names>
          </string-name>
          <year>1994</year>
          .
          <article-title>Constraint Satisfaction and Debugging for Interactive User Interfaces</article-title>
          .
          <source>Doctoral Thesis</source>
          . UMI Order Number: UMI Order No.
          <fpage>GAX95</fpage>
          -
          <lpage>09398</lpage>
          ., University of Washington.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>Spector</surname>
            ,
            <given-names>A. Z.</given-names>
          </string-name>
          <year>1989</year>
          .
          <article-title>Achieving application requirements</article-title>
          . In Distributed Systems, S. Mullender, Ed. ACM Press Frontier Series. ACM, New York, NY,
          <fpage>19</fpage>
          -
          <lpage>33</lpage>
          . DOI= http://doi.acm.
          <source>org/10</source>
          .1145/90417.90738
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>Tavel</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <year>2007</year>
          .
          <article-title>Modeling and Simulation Design. AK Peters Ltd</article-title>
          ., Natick, MA.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>Yu</surname>
            ,
            <given-names>Y. T.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Lau</surname>
            ,
            <given-names>M. F.</given-names>
          </string-name>
          <year>2006</year>
          .
          <article-title>A comparison of MC/DC, MUMCUT and several other coverage criteria for logical decisions</article-title>
          .
          <source>J. Syst. Softw</source>
          .
          <volume>79</volume>
          ,
          <issue>5</issue>
          (May.
          <year>2006</year>
          ),
          <fpage>577</fpage>
          -
          <lpage>590</lpage>
          . DOI= http://dx.doi.org/10.1016/j.jss.
          <year>2005</year>
          .
          <volume>05</volume>
          .030.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Zhao</surname>
            <given-names>O. D.</given-names>
          </string-name>
          and Sheng-qian,
          <string-name>
            <surname>M. A.</surname>
          </string-name>
          <year>2010</year>
          “
          <article-title>Speech Compression with Best Wavelet Packet Transform and</article-title>
          SPIHT Algorithm” Second International Conference on Computer Modeling and Simulation in 2010
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>