<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">Implementation of Audio Compression using Wavelet</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author>
							<persName><forename type="first">Hauwa</forename><forename type="middle">T</forename><surname>Abdulkarim</surname></persName>
							<affiliation key="aff0">
								<orgName type="department" key="dep1">Department of Electrical/Electronic Technology</orgName>
								<orgName type="department" key="dep2">College of Education</orgName>
								<address>
									<settlement>Minna</settlement>
									<country key="NG">Nigeria</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Tijjani</forename><forename type="middle">S</forename><surname>Abdulrahman</surname></persName>
							<affiliation key="aff1">
								<orgName type="department" key="dep1">Department of Electrical/Electronic Technology</orgName>
								<orgName type="department" key="dep2">College of Education</orgName>
								<address>
									<settlement>Minna</settlement>
									<country key="NG">Nigeria</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Abubakar</forename><forename type="middle">S</forename><surname>Mohammed</surname></persName>
							<affiliation key="aff2">
								<orgName type="department">Dept. of Electrical/Electronic Engineering</orgName>
								<orgName type="institution">Federal University of Technology</orgName>
								<address>
									<settlement>Minna</settlement>
									<country key="NG">Nigeria</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">Implementation of Audio Compression using Wavelet</title>
					</analytic>
					<monogr>
						<imprint>
							<date/>
						</imprint>
					</monogr>
					<idno type="MD5">3FB8C29D690F389758E8489D7455829F</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2023-03-24T00:55+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<textClass>
				<keywords>
					<term>Audio</term>
					<term>Wavelet</term>
					<term>Compression</term>
					<term>Transmission</term>
					<term>MATLAB code</term>
					<term>Performance</term>
				</keywords>
			</textClass>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><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%.</p></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.">INTRODUCTION</head><p>Audio compression-a popular 21 st century technique enables the substantial data rates associated with uncompressed digital audio signal to be efficiently stored and transmitted <ref type="bibr" target="#b0">[Bowman et al., 1993]</ref>. 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. 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 <ref type="bibr" target="#b2">[Ding and Marchionini 1997;</ref><ref type="bibr" target="#b4">Fröhlich and Plate 2000;</ref><ref type="bibr" target="#b7">Tavel 2007</ref>]. Energy is one of the scarcest resources <ref type="bibr" target="#b5">[Sannella 1994;</ref><ref type="bibr" target="#b3">Forman 2003</ref>] in such networks and data compression is one of the implementing techniques to save energy in these networks <ref type="bibr" target="#b7">[Tavel 2007</ref>].</p><p>The increase in data transfer has led to the need to develop appropriate signal processing techniques to handle audio and video compression <ref type="bibr" target="#b1">[Brown et al. 2003</ref>]. 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 <ref type="bibr" target="#b8">[Yu 2006</ref>]. 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 <ref type="bibr" target="#b6">[Spector 1989</ref>].</p><p>Audio compression is very much employed in this computer age where information can be sent over the internet and other ways <ref type="bibr">[Zhao and Shen 2010]</ref>. 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.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.">METHODOLOGY 2.1 Implementation</head><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 <ref type="figure" target="#fig_0">1</ref> 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</p><formula xml:id="formula_0">( )</formula><p>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></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.">RESULTS AND DISCUSSION</head><p>Figure <ref type="figure" target="#fig_1">2</ref> 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 <ref type="figure">3</ref>.   "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></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.">CONCLUSION</head><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></div><figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_0"><head>Figure 1 :</head><label>1</label><figDesc>Figure 1: Plot of Original Signal</figDesc><graphic coords="1,355.40,575.51,164.99,105.95" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_1"><head>Figure 2 :</head><label>2</label><figDesc>Figure 2: Approximation Coefficient</figDesc><graphic coords="2,54.00,367.46,239.70,244.29" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_2"><head>Figure 3 :Figure 4 : 3 . 1</head><label>3431</label><figDesc>Figure 3: Detail Coefficient for 3 Levels</figDesc><graphic coords="2,317.85,54.00,240.05,221.45" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_3"><head>Figure 5 :Figure 6 :</head><label>56</label><figDesc>Figure 5:Plot of Histogram of original signal and Detail values</figDesc><graphic coords="3,54.00,54.00,240.07,239.30" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_4"><head>Figure 7 :</head><label>7</label><figDesc>Figure 7: Image time-scale diagram representation of signal detail decomposition value levels</figDesc><graphic coords="3,317.85,111.75,240.08,277.35" type="bitmap" /></figure>
		</body>
		<back>

			<div type="acknowledgement">
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.">ACKNOWLEDGMENTS</head><p>The authors wish to thank Tertiary Education Trust Fund (TETFund), Abuja, Nigeria and College of Education, Minna, Nigeria for the sponsorship.</p></div>
			</div>

			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<analytic>
		<title level="a" type="main">Reasoning about naming systems</title>
		<author>
			<persName><forename type="first">M</forename><surname>Bowman</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">K</forename><surname>Debray</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><forename type="middle">L</forename><surname>Peterson</surname></persName>
		</author>
		<idno type="DOI">10.1145/161468.16147</idno>
		<ptr target="http://doi.acm.org/10.1145/161468.16147" />
	</analytic>
	<monogr>
		<title level="j">ACM Trans. Program. Lang. Syst</title>
		<imprint>
			<biblScope unit="volume">15</biblScope>
			<biblScope unit="issue">5</biblScope>
			<biblScope unit="page" from="795" to="825" />
			<date type="published" when="1993-11">1993. Nov. 1993</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">A widget framework for augmented interaction in SCAPE</title>
		<author>
			<persName><forename type="first">L</forename><forename type="middle">D</forename><surname>Brown</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Hua</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Gao</surname></persName>
		</author>
		<idno type="DOI">10.1145/964696.964697</idno>
		<ptr target="http://doi.acm.org/10.1145/964696.964697" />
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 16th Annual ACM Symposium on User Interface Software and Technology</title>
				<meeting>the 16th Annual ACM Symposium on User Interface Software and Technology<address><addrLine>Vancouver, Canada; New York, NY</addrLine></address></meeting>
		<imprint>
			<publisher>ACM</publisher>
			<date type="published" when="2003-11-02">2003. November 02 -05, 2003</date>
			<biblScope unit="page" from="1" to="10" />
		</imprint>
	</monogr>
	<note>UIST &apos;03</note>
</biblStruct>

<biblStruct xml:id="b2">
	<monogr>
		<title level="m" type="main">A Study on Video Browsing Strategies</title>
		<author>
			<persName><forename type="first">W</forename><surname>Ding</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Marchionini</surname></persName>
		</author>
		<imprint>
			<date type="published" when="1997">1997</date>
		</imprint>
		<respStmt>
			<orgName>University of Maryland at College Park</orgName>
		</respStmt>
	</monogr>
	<note type="report_type">Technical Report</note>
</biblStruct>

<biblStruct xml:id="b3">
	<analytic>
		<title level="a" type="main">An extensive empirical study of feature selection metrics for text classification</title>
		<author>
			<persName><forename type="first">G</forename><surname>Forman</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">J. Mach. Learn. Res</title>
		<imprint>
			<biblScope unit="volume">3</biblScope>
			<biblScope unit="page" from="1289" to="1305" />
			<date type="published" when="2003-03">2003. Mar. 2003</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">The cubic mouse: a new device for three-dimensional input</title>
		<author>
			<persName><forename type="first">B</forename><surname>Fröhlich</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Plate</surname></persName>
		</author>
		<idno type="DOI">10.1145/332040.332491</idno>
		<ptr target="http://doi.acm.org/10.1145/332040.332491" />
	</analytic>
	<monogr>
		<title level="m">Proceedings of the SIGCHI Conference on Human Factors in Computing Systems</title>
				<meeting>the SIGCHI Conference on Human Factors in Computing Systems<address><addrLine>The Hague, The Netherlands; New York, NY</addrLine></address></meeting>
		<imprint>
			<publisher>ACM</publisher>
			<date type="published" when="2000-04-01">2000. April 01 -06, 2000</date>
			<biblScope unit="page" from="526" to="531" />
		</imprint>
	</monogr>
	<note>CHI &apos;00</note>
</biblStruct>

<biblStruct xml:id="b5">
	<monogr>
		<title level="m" type="main">Constraint Satisfaction and Debugging for Interactive User Interfaces</title>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">J</forename><surname>Sannella</surname></persName>
		</author>
		<imprint>
			<date type="published" when="1994">1994</date>
		</imprint>
		<respStmt>
			<orgName>University of Washington</orgName>
		</respStmt>
	</monogr>
	<note type="report_type">UMI Order Number: UMI Order No. GAX95-09398</note>
</biblStruct>

<biblStruct xml:id="b6">
	<analytic>
		<title level="a" type="main">Achieving application requirements</title>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">Z</forename><surname>Spector</surname></persName>
		</author>
		<idno type="DOI">10.1145/90417.90738</idno>
		<ptr target="http://doi.acm.org/10.1145/90417.90738" />
	</analytic>
	<monogr>
		<title level="m">Distributed Systems</title>
				<editor>
			<persName><forename type="first">S</forename><surname>Mullender</surname></persName>
		</editor>
		<meeting><address><addrLine>New York, NY</addrLine></address></meeting>
		<imprint>
			<publisher>ACM</publisher>
			<date type="published" when="1989">1989</date>
			<biblScope unit="page" from="19" to="33" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b7">
	<monogr>
		<title level="m" type="main">Modeling and Simulation Design</title>
		<author>
			<persName><forename type="first">P</forename><surname>Tavel</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2007">2007</date>
			<publisher>AK Peters Ltd</publisher>
			<pubPlace>Natick, MA</pubPlace>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b8">
	<analytic>
		<title level="a" type="main">A comparison of MC/DC, MUMCUT and several other coverage criteria for logical decisions</title>
		<author>
			<persName><forename type="first">Y</forename><forename type="middle">T</forename><surname>Yu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">F</forename><surname>Lau</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.jss.2005.05.030</idno>
		<ptr target="http://dx.doi.org/10.1016/j.jss.2005.05.030" />
	</analytic>
	<monogr>
		<title level="j">J. Syst. Softw</title>
		<imprint>
			<biblScope unit="volume">79</biblScope>
			<biblScope unit="page" from="577" to="590" />
			<date type="published" when="2006-05">2006. May. 2006</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b9">
	<analytic>
		<title level="a" type="main">Speech Compression with Best Wavelet Packet Transform and SPIHT Algorithm</title>
		<author>
			<persName><forename type="first">O</forename><forename type="middle">D</forename><surname>Zhao</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">A</forename><surname>Sheng-Qian</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Second International Conference on Computer Modeling and Simulation in</title>
				<imprint>
			<date type="published" when="2010">2010. 2010</date>
		</imprint>
	</monogr>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
