CINXE.COM

<!DOCTYPE html> <html lang="en" dir="ltr"> <head>  <script async src="https://www.googletagmanager.com/gtag/js?id=G-P63WKM1TM1"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'G-P63WKM1TM1'); </script>  <script type="text/javascript" > (function(m,e,t,r,i,k,a){m[i]=m[i]||function(){(m[i].a=m[i].a||[]).push(arguments)}; m[i].l=1*new Date(); for (var j = 0; j < document.scripts.length; j++) {if (document.scripts[j].src === r) { return; }} k=e.createElement(t),a=e.getElementsByTagName(t)[0],k.async=1,k.src=r,a.parentNode.insertBefore(k,a)}) (window, document, "script", "https://mc.yandex.ru/metrika/tag.js", "ym"); ym(55165297, "init", { clickmap:false, trackLinks:true, accurateTrackBounce:true, webvisor:false }); </script> <noscript><div><img src="https://mc.yandex.ru/watch/55165297" style="position:absolute; left:-9999px;" alt="" /></div></noscript>    <title>Search results for: built-in-self-test modified selective Huffman coding</title> <meta name="description" content="Search results for: built-in-self-test modified selective Huffman coding"> <meta name="keywords" content="built-in-self-test modified selective Huffman coding"> <meta name="viewport" content="width=device-width, initial-scale=1, minimum-scale=1, maximum-scale=1, user-scalable=no"> <meta charset="utf-8"> <link href="https://cdn.waset.org/favicon.ico" type="image/x-icon" rel="shortcut icon"> <link href="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/css/bootstrap.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/plugins/fontawesome/css/all.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/css/site.css?v=150220211555" rel="stylesheet"> </head> <body> <header> <div class="container"> <nav class="navbar navbar-expand-lg navbar-light"> <a class="navbar-brand" href="https://waset.org"> <img src="https://cdn.waset.org/static/images/wasetc.png" alt="Open Science Research Excellence" title="Open Science Research Excellence" /> </a> <button class="d-block d-lg-none navbar-toggler ml-auto" type="button" data-toggle="collapse" data-target="#navbarMenu" aria-controls="navbarMenu" aria-expanded="false" aria-label="Toggle navigation"> <span class="navbar-toggler-icon"></span> </button> <div class="w-100"> <div class="d-none d-lg-flex flex-row-reverse"> <form method="get" action="https://waset.org/search" class="form-inline my-2 my-lg-0"> <input class="form-control mr-sm-2" type="search" placeholder="Search Conferences" value="built-in-self-test modified selective Huffman coding" name="q" aria-label="Search"> <button class="btn btn-light my-2 my-sm-0" type="submit"><i class="fas fa-search"></i></button> </form> </div> <div class="collapse navbar-collapse mt-1" id="navbarMenu"> <ul class="navbar-nav ml-auto align-items-center" id="mainNavMenu"> <li class="nav-item"> <a class="nav-link" href="https://waset.org/conferences" title="Conferences in 2024/2025/2026">Conferences</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/disciplines" title="Disciplines">Disciplines</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/committees" rel="nofollow">Committees</a> </li> <li class="nav-item dropdown"> <a class="nav-link dropdown-toggle" href="#" id="navbarDropdownPublications" role="button" data-toggle="dropdown" aria-haspopup="true" aria-expanded="false"> Publications </a> <div class="dropdown-menu" aria-labelledby="navbarDropdownPublications"> <a class="dropdown-item" href="https://publications.waset.org/abstracts">Abstracts</a> <a class="dropdown-item" href="https://publications.waset.org">Periodicals</a> <a class="dropdown-item" href="https://publications.waset.org/archive">Archive</a> </div> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/page/support" title="Support">Support</a> </li> </ul> </div> </div> </nav> </div> </header> <main> <div class="container mt-4"> <div class="row"> <div class="col-md-9 mx-auto"> <form method="get" action="https://publications.waset.org/search"> <div id="custom-search-input"> <div class="input-group"> <i class="fas fa-search"></i> <input type="text" class="search-query" name="q" placeholder="Author, Title, Abstract, Keywords" value="built-in-self-test modified selective Huffman coding"> <input type="submit" class="btn_search" value="Search"> </div> </div> </form> </div> </div> <div class="row mt-3"> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Commenced</strong> in January 2007</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Frequency:</strong> Monthly</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Edition:</strong> International</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Paper Count:</strong> 1389</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: built-in-self-test modified selective Huffman coding</h1> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1389</span> A Modified Run Length Coding Technique for Test Data Compression Based on Multi-Level Selective Huffman Coding</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=C.%20Kalamani">C. Kalamani</a>, <a href="https://publications.waset.org/search?q=K.%20Paramasivam"> K. Paramasivam</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Test data compression is an efficient method for reducing the test application cost. The problem of reducing test data has been addressed by researchers in three different aspects: Test Data Compression, Built-in-Self-Test (BIST) and Test set compaction. The latter two methods are capable of enhancing fault coverage with cost of hardware overhead. The drawback of the conventional methods is that they are capable of reducing the test storage and test power but when test data have redundant length of runs, no additional compression method is followed. This paper presents a modified Run Length Coding (RLC) technique with Multilevel Selective Huffman Coding (MLSHC) technique to reduce test data volume, test pattern delivery time and power dissipation in scan test applications where redundant length of runs is encountered then the preceding run symbol is replaced with tiny codeword. Experimental results show that the presented method not only improves the test data compression but also reduces the overall test data volume compared to recent schemes. Experiments for the six largest ISCAS-98 benchmarks show that our method outperforms most known techniques.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Modified%20run%20length%20coding" title="Modified run length coding">Modified run length coding</a>, <a href="https://publications.waset.org/search?q=multilevel%20selective%20Huffman%20coding" title=" multilevel selective Huffman coding"> multilevel selective Huffman coding</a>, <a href="https://publications.waset.org/search?q=built-in-self-test%20modified%20selective%20Huffman%20coding" title=" built-in-self-test modified selective Huffman coding"> built-in-self-test modified selective Huffman coding</a>, <a href="https://publications.waset.org/search?q=automatic%20test%20equipment." title=" automatic test equipment."> automatic test equipment.</a> </p> <a href="https://publications.waset.org/10007222/a-modified-run-length-coding-technique-for-test-data-compression-based-on-multi-level-selective-huffman-coding" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10007222/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10007222/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10007222/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10007222/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10007222/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10007222/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10007222/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10007222/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10007222/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10007222/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10007222.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1274</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1388</span> Peak-to-Average Power Ratio Reduction in OFDM Systems using Huffman Coding</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Ashraf%20A.%20Eltholth">Ashraf A. Eltholth</a>, <a href="https://publications.waset.org/search?q=Adel%20R.%20Mikhail"> Adel R. Mikhail</a>, <a href="https://publications.waset.org/search?q=A.%20Elshirbini"> A. Elshirbini</a>, <a href="https://publications.waset.org/search?q=Moawad%20I.%20Moawad"> Moawad I. Moawad</a>, <a href="https://publications.waset.org/search?q=A.%20I.%20Abdelfattah"> A. I. Abdelfattah</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper we proposed the use of Huffman coding to reduce the PAR of an OFDM system as a distortionless scrambling technique, and we utilize the amount saved in the total bit rate by the Huffman coding to send the encoding table for accurate decoding at the receiver without reducing the effective throughput. We found that the use of Huffman coding reduces the PAR by about 6 dB. Also we have investigated the effect of PAR reduction due to Huffman coding through testing the spectral spreading and the inband distortion due to HPA with different IBO values. We found a complete match of our expectation from the proposed solution with the obtained simulation results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=HPA" title="HPA">HPA</a>, <a href="https://publications.waset.org/search?q=Huffman%20coding" title=" Huffman coding"> Huffman coding</a>, <a href="https://publications.waset.org/search?q=OFDM" title=" OFDM"> OFDM</a>, <a href="https://publications.waset.org/search?q=PAR" title=" PAR"> PAR</a> </p> <a href="https://publications.waset.org/1174/peak-to-average-power-ratio-reduction-in-ofdm-systems-using-huffman-coding" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/1174/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/1174/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/1174/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/1174/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/1174/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/1174/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/1174/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/1174/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/1174/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/1174/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/1174.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2597</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1387</span> Coding of DWT Coefficients using Run-length Coding and Huffman Coding for the Purpose of Color Image Compression</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Varun%20Setia">Varun Setia</a>, <a href="https://publications.waset.org/search?q=Vinod%20Kumar"> Vinod Kumar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In present paper we proposed a simple and effective method to compress an image. Here we found success in size reduction of an image without much compromising with it-s quality. Here we used Haar Wavelet Transform to transform our original image and after quantization and thresholding of DWT coefficients Run length coding and Huffman coding schemes have been used to encode the image. DWT is base for quite populate JPEG 2000 technique.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Lossy%20compression" title="Lossy compression">Lossy compression</a>, <a href="https://publications.waset.org/search?q=DWT" title=" DWT"> DWT</a>, <a href="https://publications.waset.org/search?q=quantization" title=" quantization"> quantization</a>, <a href="https://publications.waset.org/search?q=Run%20length%20coding" title=" Run length coding"> Run length coding</a>, <a href="https://publications.waset.org/search?q=Huffman%20coding" title=" Huffman coding"> Huffman coding</a>, <a href="https://publications.waset.org/search?q=JPEG2000." title=" JPEG2000."> JPEG2000.</a> </p> <a href="https://publications.waset.org/12609/coding-of-dwt-coefficients-using-run-length-coding-and-huffman-coding-for-the-purpose-of-color-image-compression" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/12609/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/12609/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/12609/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/12609/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/12609/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/12609/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/12609/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/12609/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/12609/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/12609/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/12609.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2923</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1386</span> Scintigraphic Image Coding of Region of Interest Based On SPIHT Algorithm Using Global Thresholding and Huffman Coding</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=A.%20Seddiki">A. Seddiki</a>, <a href="https://publications.waset.org/search?q=M.%20Djebbouri"> M. Djebbouri</a>, <a href="https://publications.waset.org/search?q=D.%20Guerchi"> D. Guerchi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Medical imaging produces human body pictures in digital form. Since these imaging techniques produce prohibitive amounts of data, compression is necessary for storage and communication purposes. Many current compression schemes provide a very high compression rate but with considerable loss of quality. On the other hand, in some areas in medicine, it may be sufficient to maintain high image quality only in region of interest (ROI). This paper discusses a contribution to the lossless compression in the region of interest of Scintigraphic images based on SPIHT algorithm and global transform thresholding using Huffman coding.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Global%20Thresholding%20Transform" title="Global Thresholding Transform">Global Thresholding Transform</a>, <a href="https://publications.waset.org/search?q=Huffman%20Coding" title=" Huffman Coding"> Huffman Coding</a>, <a href="https://publications.waset.org/search?q=Region%20of%20Interest" title=" Region of Interest"> Region of Interest</a>, <a href="https://publications.waset.org/search?q=SPIHT%20Coding" title=" SPIHT Coding"> SPIHT Coding</a>, <a href="https://publications.waset.org/search?q=Scintigraphic%20images." title=" Scintigraphic images."> Scintigraphic images.</a> </p> <a href="https://publications.waset.org/9999952/scintigraphic-image-coding-of-region-of-interest-based-on-spiht-algorithm-using-global-thresholding-and-huffman-coding" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9999952/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9999952/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9999952/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9999952/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9999952/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9999952/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9999952/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9999952/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9999952/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9999952/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9999952.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1980</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1385</span> Efficient Secured Lossless Coding of Medical Images– Using Modified Runlength Coding for Character Representation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=S.%20Annadurai">S. Annadurai</a>, <a href="https://publications.waset.org/search?q=P.%20Geetha"> P. Geetha</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Lossless compression schemes with secure transmission play a key role in telemedicine applications that helps in accurate diagnosis and research. Traditional cryptographic algorithms for data security are not fast enough to process vast amount of data. Hence a novel Secured lossless compression approach proposed in this paper is based on reversible integer wavelet transform, EZW algorithm, new modified runlength coding for character representation and selective bit scrambling. The use of the lifting scheme allows generating truly lossless integer-to-integer wavelet transforms. Images are compressed/decompressed by well-known EZW algorithm. The proposed modified runlength coding greatly improves the compression performance and also increases the security level. This work employs scrambling method which is fast, simple to implement and it provides security. Lossless compression ratios and distortion performance of this proposed method are found to be better than other lossless techniques. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=EZW%20algorithm" title="EZW algorithm">EZW algorithm</a>, <a href="https://publications.waset.org/search?q=lifting%20scheme" title=" lifting scheme"> lifting scheme</a>, <a href="https://publications.waset.org/search?q=losslesscompression" title=" losslesscompression"> losslesscompression</a>, <a href="https://publications.waset.org/search?q=reversible%20integer%20wavelet%20transform" title=" reversible integer wavelet transform"> reversible integer wavelet transform</a>, <a href="https://publications.waset.org/search?q=securetransmission" title=" securetransmission"> securetransmission</a>, <a href="https://publications.waset.org/search?q=selective%20bit%20scrambling" title=" selective bit scrambling"> selective bit scrambling</a>, <a href="https://publications.waset.org/search?q=modified%20runlength%20coding%20." title=" modified runlength coding ."> modified runlength coding .</a> </p> <a href="https://publications.waset.org/9700/efficient-secured-lossless-coding-of-medical-images-using-modified-runlength-coding-for-character-representation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9700/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9700/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9700/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9700/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9700/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9700/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9700/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9700/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9700/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9700/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9700.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1367</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1384</span> Design of Encoding Calculator Software for Huffman and Shannon-Fano Algorithms</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Wilson%20Chanhemo">Wilson Chanhemo</a>, <a href="https://publications.waset.org/search?q=Henry.%20R.%20Mgombelo"> Henry. R. Mgombelo</a>, <a href="https://publications.waset.org/search?q=Omar%20F%20Hamad"> Omar F Hamad</a>, <a href="https://publications.waset.org/search?q=T.%20Marwala"> T. Marwala</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a design of source encoding calculator software which applies the two famous algorithms in the field of information theory- the Shannon-Fano and the Huffman schemes. This design helps to easily realize the algorithms without going into a cumbersome, tedious and prone to error manual mechanism of encoding the signals during the transmission. The work describes the design of the software, how it works, comparison with related works, its efficiency, its usefulness in the field of information technology studies and the future prospects of the software to engineers, students, technicians and alike. The designed “Encodia" software has been developed, tested and found to meet the intended requirements. It is expected that this application will help students and teaching staff in their daily doing of information theory related tasks. The process is ongoing to modify this tool so that it can also be more intensely useful in research activities on source coding. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Coding%20techniques" title="Coding techniques">Coding techniques</a>, <a href="https://publications.waset.org/search?q=Coding%20algorithms" title=" Coding algorithms"> Coding algorithms</a>, <a href="https://publications.waset.org/search?q=Codingefficiency" title=" Codingefficiency"> Codingefficiency</a>, <a href="https://publications.waset.org/search?q=Encodia" title=" Encodia"> Encodia</a>, <a href="https://publications.waset.org/search?q=Encoding%20software." title=" Encoding software."> Encoding software.</a> </p> <a href="https://publications.waset.org/13156/design-of-encoding-calculator-software-for-huffman-and-shannon-fano-algorithms" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/13156/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/13156/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/13156/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/13156/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/13156/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/13156/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/13156/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/13156/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/13156/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/13156/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/13156.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">3472</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1383</span> EZW Coding System with Artificial Neural Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Saudagar%20Abdul%20Khader%20Jilani">Saudagar Abdul Khader Jilani</a>, <a href="https://publications.waset.org/search?q=Syed%20Abdul%20Sattar"> Syed Abdul Sattar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Image compression plays a vital role in today-s communication. The limitation in allocated bandwidth leads to slower communication. To exchange the rate of transmission in the limited bandwidth the Image data must be compressed before transmission. Basically there are two types of compressions, 1) LOSSY compression and 2) LOSSLESS compression. Lossy compression though gives more compression compared to lossless compression; the accuracy in retrievation is less in case of lossy compression as compared to lossless compression. JPEG, JPEG2000 image compression system follows huffman coding for image compression. JPEG 2000 coding system use wavelet transform, which decompose the image into different levels, where the coefficient in each sub band are uncorrelated from coefficient of other sub bands. Embedded Zero tree wavelet (EZW) coding exploits the multi-resolution properties of the wavelet transform to give a computationally simple algorithm with better performance compared to existing wavelet transforms. For further improvement of compression applications other coding methods were recently been suggested. An ANN base approach is one such method. Artificial Neural Network has been applied to many problems in image processing and has demonstrated their superiority over classical methods when dealing with noisy or incomplete data for image compression applications. The performance analysis of different images is proposed with an analysis of EZW coding system with Error Backpropagation algorithm. The implementation and analysis shows approximately 30% more accuracy in retrieved image compare to the existing EZW coding system. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Accuracy" title="Accuracy">Accuracy</a>, <a href="https://publications.waset.org/search?q=Compression" title=" Compression"> Compression</a>, <a href="https://publications.waset.org/search?q=EZW" title=" EZW"> EZW</a>, <a href="https://publications.waset.org/search?q=JPEG2000" title=" JPEG2000"> JPEG2000</a>, <a href="https://publications.waset.org/search?q=Performance." title="Performance.">Performance.</a> </p> <a href="https://publications.waset.org/14955/ezw-coding-system-with-artificial-neural-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/14955/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/14955/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/14955/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/14955/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/14955/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/14955/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/14955/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/14955/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/14955/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/14955/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/14955.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1934</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1382</span> An Implementation of Data Reusable MPEG Video Coding Scheme </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Vasily%20G.%20Moshnyaga">Vasily G. Moshnyaga</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This paper presents an optimized MPEG2 video codec implementation, which drastically reduces the number of computations and memory accesses required for video compression. Unlike traditional scheme, we reuse data stored in frame memory to omit unnecessary coding operations and memory read/writes for unchanged macroblocks. Due to dynamic memory sharing among reference frames, data-driven macroblock characterization and selective macroblock processing, we perform less than 15% of the total operations required by a conventional coder while maintaining high picture quality.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Data%20reuse" title="Data reuse">Data reuse</a>, <a href="https://publications.waset.org/search?q=adaptive%20processing" title=" adaptive processing"> adaptive processing</a>, <a href="https://publications.waset.org/search?q=video%20coding" title=" video coding"> video coding</a>, <a href="https://publications.waset.org/search?q=MPEG" title="MPEG">MPEG</a> </p> <a href="https://publications.waset.org/12472/an-implementation-of-data-reusable-mpeg-video-coding-scheme" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/12472/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/12472/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/12472/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/12472/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/12472/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/12472/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/12472/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/12472/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/12472/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/12472/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/12472.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1266</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1381</span> Selective Mutation for Genetic Algorithms</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Sung%20Hoon%20Jung">Sung Hoon Jung</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we propose a selective mutation method for improving the performances of genetic algorithms. In selective mutation, individuals are first ranked and then additionally mutated one bit in a part of their strings which is selected corresponding to their ranks. This selective mutation helps genetic algorithms to fast approach the global optimum and to quickly escape local optima. This results in increasing the performances of genetic algorithms. We measured the effects of selective mutation with four function optimization problems. It was found from extensive experiments that the selective mutation can significantly enhance the performances of genetic algorithms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Genetic%20algorithm" title="Genetic algorithm">Genetic algorithm</a>, <a href="https://publications.waset.org/search?q=selective%20mutation" title=" selective mutation"> selective mutation</a>, <a href="https://publications.waset.org/search?q=function%20optimization" title=" function optimization"> function optimization</a> </p> <a href="https://publications.waset.org/10404/selective-mutation-for-genetic-algorithms" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10404/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10404/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10404/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10404/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10404/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10404/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10404/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10404/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10404/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10404/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10404.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1836</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1380</span> Near-Lossless Image Coding based on Orthogonal Polynomials</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Krishnamoorthy%20R">Krishnamoorthy R</a>, <a href="https://publications.waset.org/search?q=Rajavijayalakshmi%20K"> Rajavijayalakshmi K</a>, <a href="https://publications.waset.org/search?q=Punidha%20R"> Punidha R</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a near lossless image coding scheme based on Orthogonal Polynomials Transform (OPT) has been presented. The polynomial operators and polynomials basis operators are obtained from set of orthogonal polynomials functions for the proposed transform coding. The image is partitioned into a number of distinct square blocks and the proposed transform coding is applied to each of these individually. After applying the proposed transform coding, the transformed coefficients are rearranged into a sub-band structure. The Embedded Zerotree (EZ) coding algorithm is then employed to quantize the coefficients. The proposed transform is implemented for various block sizes and the performance is compared with existing Discrete Cosine Transform (DCT) transform coding scheme. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Near-lossless%20Coding" title="Near-lossless Coding">Near-lossless Coding</a>, <a href="https://publications.waset.org/search?q=Orthogonal%20Polynomials%0ATransform" title=" Orthogonal Polynomials Transform"> Orthogonal Polynomials Transform</a>, <a href="https://publications.waset.org/search?q=Embedded%20Zerotree%20Coding" title=" Embedded Zerotree Coding"> Embedded Zerotree Coding</a> </p> <a href="https://publications.waset.org/13669/near-lossless-image-coding-based-on-orthogonal-polynomials" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/13669/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/13669/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/13669/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/13669/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/13669/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/13669/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/13669/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/13669/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/13669/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/13669/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/13669.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1944</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1379</span> An Analysis of Genetic Algorithm Based Test Data Compression Using Modified PRL Coding</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=K.%20S.%20Neelukumari">K. S. Neelukumari</a>, <a href="https://publications.waset.org/search?q=K.%20B.%20Jayanthi"> K. B. Jayanthi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper genetic based test data compression is targeted for improving the compression ratio and for reducing the computation time. The genetic algorithm is based on extended pattern run-length coding. The test set contains a large number of X value that can be effectively exploited to improve the test data compression. In this coding method, a reference pattern is set and its compatibility is checked. For this process, a genetic algorithm is proposed to reduce the computation time of encoding algorithm. This coding technique encodes the 2n compatible pattern or the inversely compatible pattern into a single test data segment or multiple test data segment. The experimental result shows that the compression ratio and computation time is reduced. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Backtracking" title="Backtracking">Backtracking</a>, <a href="https://publications.waset.org/search?q=test%20data%20compression%20%28TDC%29" title=" test data compression (TDC)"> test data compression (TDC)</a>, <a href="https://publications.waset.org/search?q=x-filling" title=" x-filling"> x-filling</a>, <a href="https://publications.waset.org/search?q=x-propagating%20and%20genetic%20algorithm." title=" x-propagating and genetic algorithm."> x-propagating and genetic algorithm.</a> </p> <a href="https://publications.waset.org/10002865/an-analysis-of-genetic-algorithm-based-test-data-compression-using-modified-prl-coding" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10002865/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10002865/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10002865/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10002865/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10002865/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10002865/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10002865/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10002865/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10002865/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10002865/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10002865.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1870</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1378</span> Eukaryotic Gene Prediction by an Investigation of Nonlinear Dynamical Modeling Techniques on EIIP Coded Sequences</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Mai%20S.%20Mabrouk">Mai S. Mabrouk</a>, <a href="https://publications.waset.org/search?q=Nahed%20H.%20Solouma"> Nahed H. Solouma</a>, <a href="https://publications.waset.org/search?q=Abou-Bakr%20M.%20Youssef"> Abou-Bakr M. Youssef</a>, <a href="https://publications.waset.org/search?q=Yasser%20M.%20Kadah"> Yasser M. Kadah</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Many digital signal processing, techniques have been used to automatically distinguish protein coding regions (exons) from non-coding regions (introns) in DNA sequences. In this work, we have characterized these sequences according to their nonlinear dynamical features such as moment invariants, correlation dimension, and largest Lyapunov exponent estimates. We have applied our model to a number of real sequences encoded into a time series using EIIP sequence indicators. In order to discriminate between coding and non coding DNA regions, the phase space trajectory was first reconstructed for coding and non-coding regions. Nonlinear dynamical features are extracted from those regions and used to investigate a difference between them. Our results indicate that the nonlinear dynamical characteristics have yielded significant differences between coding (CR) and non-coding regions (NCR) in DNA sequences. Finally, the classifier is tested on real genes where coding and non-coding regions are well known.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Gene%20prediction" title="Gene prediction">Gene prediction</a>, <a href="https://publications.waset.org/search?q=nonlinear%20dynamics" title=" nonlinear dynamics"> nonlinear dynamics</a>, <a href="https://publications.waset.org/search?q=correlation%20dimension" title=" correlation dimension"> correlation dimension</a>, <a href="https://publications.waset.org/search?q=Lyapunov%20exponent." title=" Lyapunov exponent."> Lyapunov exponent.</a> </p> <a href="https://publications.waset.org/9460/eukaryotic-gene-prediction-by-an-investigation-of-nonlinear-dynamical-modeling-techniques-on-eiip-coded-sequences" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9460/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9460/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9460/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9460/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9460/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9460/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9460/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9460/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9460/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9460/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9460.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1825</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1377</span> MIM: A Species Independent Approach for Classifying Coding and Non-Coding DNA Sequences in Bacterial and Archaeal Genomes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Achraf%20El%20Allali">Achraf El Allali</a>, <a href="https://publications.waset.org/search?q=John%20R.%20Rose"> John R. Rose</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A number of competing methodologies have been developed to identify genes and classify DNA sequences into coding and non-coding sequences. This classification process is fundamental in gene finding and gene annotation tools and is one of the most challenging tasks in bioinformatics and computational biology. An information theory measure based on mutual information has shown good accuracy in classifying DNA sequences into coding and noncoding. In this paper we describe a species independent iterative approach that distinguishes coding from non-coding sequences using the mutual information measure (MIM). A set of sixty prokaryotes is used to extract universal training data. To facilitate comparisons with the published results of other researchers, a test set of 51 bacterial and archaeal genomes was used to evaluate MIM. These results demonstrate that MIM produces superior results while remaining species independent. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Coding%20Non-coding%20Classification" title="Coding Non-coding Classification">Coding Non-coding Classification</a>, <a href="https://publications.waset.org/search?q=Entropy" title=" Entropy"> Entropy</a>, <a href="https://publications.waset.org/search?q=GeneRecognition" title=" GeneRecognition"> GeneRecognition</a>, <a href="https://publications.waset.org/search?q=Mutual%20Information." title=" Mutual Information."> Mutual Information.</a> </p> <a href="https://publications.waset.org/9008/mim-a-species-independent-approach-for-classifying-coding-and-non-coding-dna-sequences-in-bacterial-and-archaeal-genomes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9008/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9008/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9008/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9008/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9008/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9008/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9008/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9008/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9008/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9008/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9008.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1728</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1376</span> Parallel Joint Channel Coding and Cryptography</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Nata%C5%A1a%20%C5%BDivi%C4%87">Nataša Živić</a>, <a href="https://publications.waset.org/search?q=Christoph%20Ruland"> Christoph Ruland</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Method of Parallel Joint Channel Coding and Cryptography has been analyzed and simulated in this paper. The method is an extension of Soft Input Decryption with feedback, which is used for improvement of channel decoding of secured messages. Parallel Joint Channel Coding and Cryptography results in improved coding gain of channel decoding, which achieves more than 2 dB. Such results are an implication of a combination of receiver components and their interoperability. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Block%20length" title="Block length">Block length</a>, <a href="https://publications.waset.org/search?q=Coding%20gain" title=" Coding gain"> Coding gain</a>, <a href="https://publications.waset.org/search?q=Feedback" title=" Feedback"> Feedback</a>, <a href="https://publications.waset.org/search?q=L-values" title=" L-values"> L-values</a>, <a href="https://publications.waset.org/search?q=Parallel%20Joint%20Channel%20Coding%20and%20Cryptography" title=" Parallel Joint Channel Coding and Cryptography"> Parallel Joint Channel Coding and Cryptography</a>, <a href="https://publications.waset.org/search?q=Soft%20Input%0ADecryption." title=" Soft Input Decryption."> Soft Input Decryption.</a> </p> <a href="https://publications.waset.org/8203/parallel-joint-channel-coding-and-cryptography" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/8203/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/8203/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/8203/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/8203/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/8203/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/8203/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/8203/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/8203/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/8203/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/8203/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/8203.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1585</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1375</span> Fingerprint Compression Using Contourlet Transform and Multistage Vector Quantization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=S.%20Esakkirajan">S. Esakkirajan</a>, <a href="https://publications.waset.org/search?q=T.%20Veerakumar"> T. Veerakumar</a>, <a href="https://publications.waset.org/search?q=V.%20Senthil%20Murugan"> V. Senthil Murugan</a>, <a href="https://publications.waset.org/search?q=R.%20Sudhakar"> R. Sudhakar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a new fingerprint coding technique based on contourlet transform and multistage vector quantization. Wavelets have shown their ability in representing natural images that contain smooth areas separated with edges. However, wavelets cannot efficiently take advantage of the fact that the edges usually found in fingerprints are smooth curves. This issue is addressed by directional transforms, known as contourlets, which have the property of preserving edges. The contourlet transform is a new extension to the wavelet transform in two dimensions using nonseparable and directional filter banks. The computation and storage requirements are the major difficulty in implementing a vector quantizer. In the full-search algorithm, the computation and storage complexity is an exponential function of the number of bits used in quantizing each frame of spectral information. The storage requirement in multistage vector quantization is less when compared to full search vector quantization. The coefficients of contourlet transform are quantized by multistage vector quantization. The quantized coefficients are encoded by Huffman coding. The results obtained are tabulated and compared with the existing wavelet based ones. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Contourlet%20Transform" title="Contourlet Transform">Contourlet Transform</a>, <a href="https://publications.waset.org/search?q=Directional%20Filter%20bank" title=" Directional Filter bank"> Directional Filter bank</a>, <a href="https://publications.waset.org/search?q=Laplacian%20Pyramid" title=" Laplacian Pyramid"> Laplacian Pyramid</a>, <a href="https://publications.waset.org/search?q=Multistage%20Vector%20Quantization" title=" Multistage Vector Quantization"> Multistage Vector Quantization</a> </p> <a href="https://publications.waset.org/7927/fingerprint-compression-using-contourlet-transform-and-multistage-vector-quantization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/7927/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/7927/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/7927/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/7927/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/7927/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/7927/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/7927/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/7927/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/7927/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/7927/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/7927.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2014</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1374</span> Enhanced Frame-based Video Coding to Support Content-based Functionalities</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Prabhudev%20Hosur">Prabhudev Hosur</a>, <a href="https://publications.waset.org/search?q=Rolando%20Carrasco"> Rolando Carrasco</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This paper presents the enhanced frame-based video coding scheme. The input source video to the enhanced frame-based video encoder consists of a rectangular-size video and shapes of arbitrarily-shaped objects on video frames. The rectangular frame texture is encoded by the conventional frame-based coding technique and the video object-s shape is encoded using the contour-based vertex coding. It is possible to achieve several useful content-based functionalities by utilizing the shape information in the bitstream at the cost of a very small overhead to the bitrate.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Video%20coding" title="Video coding">Video coding</a>, <a href="https://publications.waset.org/search?q=content-based" title=" content-based"> content-based</a>, <a href="https://publications.waset.org/search?q=hyper%20video" title=" hyper video"> hyper video</a>, <a href="https://publications.waset.org/search?q=interactivity" title=" interactivity"> interactivity</a>, <a href="https://publications.waset.org/search?q=shape%20coding" title=" shape coding"> shape coding</a>, <a href="https://publications.waset.org/search?q=polygon." title=" polygon."> polygon.</a> </p> <a href="https://publications.waset.org/13244/enhanced-frame-based-video-coding-to-support-content-based-functionalities" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/13244/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/13244/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/13244/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/13244/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/13244/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/13244/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/13244/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/13244/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/13244/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/13244/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/13244.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1662</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1373</span> Wavelet Compression of ECG Signals Using SPIHT Algorithm </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Mohammad%20Pooyan">Mohammad Pooyan</a>, <a href="https://publications.waset.org/search?q=Ali%20Taheri"> Ali Taheri</a>, <a href="https://publications.waset.org/search?q=Morteza%20Moazami-Goudarzi"> Morteza Moazami-Goudarzi</a>, <a href="https://publications.waset.org/search?q=Iman%20Saboori"> Iman Saboori</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this paper we present a novel approach for wavelet compression of electrocardiogram (ECG) signals based on the set partitioning in hierarchical trees (SPIHT) coding algorithm. SPIHT algorithm has achieved prominent success in image compression. Here we use a modified version of SPIHT for one dimensional signals. We applied wavelet transform with SPIHT coding algorithm on different records of MIT-BIH database. The results show the high efficiency of this method in ECG compression.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=ECG%20compression" title="ECG compression">ECG compression</a>, <a href="https://publications.waset.org/search?q=wavelet" title=" wavelet"> wavelet</a>, <a href="https://publications.waset.org/search?q=SPIHT." title=" SPIHT."> SPIHT.</a> </p> <a href="https://publications.waset.org/9042/wavelet-compression-of-ecg-signals-using-spiht-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9042/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9042/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9042/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9042/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9042/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9042/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9042/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9042/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9042/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9042/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9042.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">2398</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1372</span> A Multi-Signature Scheme based on Coding Theory</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Mohammed%20Meziani">Mohammed Meziani</a>, <a href="https://publications.waset.org/search?q=Pierre-Louis%20Cayrel"> Pierre-Louis Cayrel</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper we propose two first non-generic constructions of multisignature scheme based on coding theory. The first system make use of the CFS signature scheme and is secure in random oracle while the second scheme is based on the KKS construction and is a few times. The security of our construction relies on a difficult problems in coding theory: The Syndrome Decoding problem which has been proved NP-complete [4]. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Post-quantum%20cryptography" title="Post-quantum cryptography">Post-quantum cryptography</a>, <a href="https://publications.waset.org/search?q=Coding-based%20cryptography" title=" Coding-based cryptography"> Coding-based cryptography</a>, <a href="https://publications.waset.org/search?q=Digital%20signature" title="Digital signature">Digital signature</a>, <a href="https://publications.waset.org/search?q=Multisignature%20scheme." title=" Multisignature scheme."> Multisignature scheme.</a> </p> <a href="https://publications.waset.org/5409/a-multi-signature-scheme-based-on-coding-theory" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/5409/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/5409/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/5409/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/5409/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/5409/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/5409/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/5409/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/5409/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/5409/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/5409/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/5409.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1880</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1371</span> Selective Intra Prediction Mode Decision for H.264/AVC Encoders</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Jun%20Sung%20Park">Jun Sung Park</a>, <a href="https://publications.waset.org/search?q=Hyo%20Jung%20Song"> Hyo Jung Song</a> </p> <p class="card-text"><strong>Abstract:</strong></p> H.264/AVC offers a considerably higher improvement in coding efficiency compared to other compression standards such as MPEG-2, but computational complexity is increased significantly. In this paper, we propose selective mode decision schemes for fast intra prediction mode selection. The objective is to reduce the computational complexity of the H.264/AVC encoder without significant rate-distortion performance degradation. In our proposed schemes, the intra prediction complexity is reduced by limiting the luma and chroma prediction modes using the directional information of the 16×16 prediction mode. Experimental results are presented to show that the proposed schemes reduce the complexity by up to 78% maintaining the similar PSNR quality with about 1.46% bit rate increase in average. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Video%20encoding" title="Video encoding">Video encoding</a>, <a href="https://publications.waset.org/search?q=H.264" title=" H.264"> H.264</a>, <a href="https://publications.waset.org/search?q=Intra%20prediction." title=" Intra prediction."> Intra prediction.</a> </p> <a href="https://publications.waset.org/1738/selective-intra-prediction-mode-decision-for-h264avc-encoders" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/1738/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/1738/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/1738/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/1738/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/1738/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/1738/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/1738/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/1738/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/1738/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/1738/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/1738.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">3468</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1370</span> Usage of Channel Coding Techniques for Peak-to-Average Power Ratio Reduction in Visible Light Communications Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=P.L.D.N.M.%20de%20Silva">P.L.D.N.M. de Silva</a>, <a href="https://publications.waset.org/search?q=S.G.%20Edirisinghe"> S.G. Edirisinghe</a>, <a href="https://publications.waset.org/search?q=R.%20Weerasuriya"> R. Weerasuriya</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>High Peak-to-Average Power Ratio (PAPR) is a concern of Orthogonal Frequency Division Multiplexing (OFDM) based Visible Light Communication (VLC) systems. Discrete Fourier Transform spread (DFT-s) OFDM is an alternative single carrier modulation scheme which would address this concern. Employing channel coding techniques is another mechanism to reduce the PAPR. In this study, the improvement which can be harnessed by hybridizing these two techniques for VLC system is being studied. Within the study, efficient techniques such as Hamming coding and Convolutional coding have been studied. Thus, we present the impact of the hybrid of DFT-s OFDM and Channel coding (Hamming coding and Convolutional coding) on PAPR in VLC systems, using MATLAB simulations.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Convolutional%20Coding" title="Convolutional Coding">Convolutional Coding</a>, <a href="https://publications.waset.org/search?q=Discrete%20Fourier%20Transform%0D%0Aspread%20Orthogonal%20Frequency%20Division%20Multiplexing%20%28DFT-s%20OFDM%29" title=" Discrete Fourier Transform spread Orthogonal Frequency Division Multiplexing (DFT-s OFDM)"> Discrete Fourier Transform spread Orthogonal Frequency Division Multiplexing (DFT-s OFDM)</a>, <a href="https://publications.waset.org/search?q=Hamming%20Coding" title=" Hamming Coding"> Hamming Coding</a>, <a href="https://publications.waset.org/search?q=Peak-to-Average%20Power%20Ratio%20%28PAPR%29" title=" Peak-to-Average Power Ratio (PAPR)"> Peak-to-Average Power Ratio (PAPR)</a>, <a href="https://publications.waset.org/search?q=Visible%0D%0ALight%20Communications%20%28VLC%29." title=" Visible Light Communications (VLC)."> Visible Light Communications (VLC).</a> </p> <a href="https://publications.waset.org/10012900/usage-of-channel-coding-techniques-for-peak-to-average-power-ratio-reduction-in-visible-light-communications-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10012900/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10012900/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10012900/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10012900/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10012900/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10012900/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10012900/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10012900/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10012900/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10012900/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10012900.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">513</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1369</span> An Evaluation of Algorithms for Single-Echo Biosonar Target Classification</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Turgay%20Temel">Turgay Temel</a>, <a href="https://publications.waset.org/search?q=John%20Hallam">John Hallam</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>A recent neurospiking coding scheme for feature extraction from biosonar echoes of various plants is examined with avariety of stochastic classifiers. Feature vectors derived are employedin well-known stochastic classifiers, including nearest-neighborhood,single Gaussian and a Gaussian mixture with EM optimization.Classifiers' performances are evaluated by using cross-validation and bootstrapping techniques. It is shown that the various classifers perform equivalently and that the modified preprocessing configuration yields considerably improved results.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Classification" title="Classification">Classification</a>, <a href="https://publications.waset.org/search?q=neuro-spike%20coding" title=" neuro-spike coding"> neuro-spike coding</a>, <a href="https://publications.waset.org/search?q=non-parametricmodel" title=" non-parametricmodel"> non-parametricmodel</a>, <a href="https://publications.waset.org/search?q=parametric%20model" title=" parametric model"> parametric model</a>, <a href="https://publications.waset.org/search?q=Gaussian%20mixture" title=" Gaussian mixture"> Gaussian mixture</a>, <a href="https://publications.waset.org/search?q=EM%20algorithm." title=" EM algorithm."> EM algorithm.</a> </p> <a href="https://publications.waset.org/972/an-evaluation-of-algorithms-for-single-echo-biosonar-target-classification" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/972/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/972/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/972/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/972/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/972/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/972/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/972/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/972/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/972/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/972/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/972.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1669</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1368</span> The Need for Selective Credit Policy Implementation: Case of Croatia</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Drago%20Jakovcevic">Drago Jakovcevic</a>, <a href="https://publications.waset.org/search?q=Mihovil%20Andelinovic"> Mihovil Andelinovic</a>, <a href="https://publications.waset.org/search?q=Igor%20Husak"> Igor Husak</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>The aim of this paper is to explore the economic circumstances in which the selective credit policy, the least used instrument of four types of instruments on disposal to central banks, should be used. The most significant example includes the use of selective credit policies in response to the emergence of the global financial crisis by the FED. Specifics of the potential use of selective credit policies as the instigator of economic growth in Croatia, a small open economy, are determined by high euroization of financial system, fixed exchange rate and long-term trend growth of external debt that is related to the need to maintain high levels of foreign reserves. In such conditions, the classic forms of selective credit policies are unsuitable for the introduction. Several alternative approaches to implement selective credit policies are examined in this paper. Also, thorough analysis of distribution of selective monetary policy loans among economic sectors in Croatia is conducted in order to minimize the risk of investing funds and maximize the return, in order to influence the GDP growth.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Global%20crisis" title="Global crisis">Global crisis</a>, <a href="https://publications.waset.org/search?q=Selective%20credit%20policy" title=" Selective credit policy"> Selective credit policy</a>, <a href="https://publications.waset.org/search?q=Small%20open%20economy." title=" Small open economy."> Small open economy.</a> </p> <a href="https://publications.waset.org/9998424/the-need-for-selective-credit-policy-implementation-case-of-croatia" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9998424/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9998424/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9998424/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9998424/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9998424/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9998424/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9998424/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9998424/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9998424/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9998424/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9998424.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1618</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1367</span> High Quality Speech Coding using Combined Parametric and Perceptual Modules</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=M.%20Kulesza">M. Kulesza</a>, <a href="https://publications.waset.org/search?q=G.%20Szwoch"> G. Szwoch</a>, <a href="https://publications.waset.org/search?q=A.%20Czy%C5%BCewski"> A. Czyżewski</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>A novel approach to speech coding using the hybrid architecture is presented. Advantages of parametric and perceptual coding methods are utilized together in order to create a speech coding algorithm assuring better signal quality than in traditional CELP parametric codec. Two approaches are discussed. One is based on selection of voiced signal components that are encoded using parametric algorithm, unvoiced components that are encoded perceptually and transients that remain unencoded. The second approach uses perceptual encoding of the residual signal in CELP codec. The algorithm applied for precise transient selection is described. Signal quality achieved using the proposed hybrid codec is compared to quality of some standard speech codecs.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=CELP%20residual%20coding" title="CELP residual coding">CELP residual coding</a>, <a href="https://publications.waset.org/search?q=hybrid%20codec%20architecture" title=" hybrid codec architecture"> hybrid codec architecture</a>, <a href="https://publications.waset.org/search?q=perceptual%20speech%20coding" title=" perceptual speech coding"> perceptual speech coding</a>, <a href="https://publications.waset.org/search?q=speech%20codecs%20comparison." title=" speech codecs comparison."> speech codecs comparison.</a> </p> <a href="https://publications.waset.org/959/high-quality-speech-coding-using-combined-parametric-and-perceptual-modules" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/959/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/959/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/959/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/959/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/959/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/959/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/959/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/959/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/959/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/959/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/959.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1530</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1366</span> Reduction of Multiple User Interference for Optical CDMA Systems Using Successive Interference Cancellation Scheme</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Tawfig%20Eltaif">Tawfig Eltaif</a>, <a href="https://publications.waset.org/search?q=Hesham%20A.%20Bakarman"> Hesham A. Bakarman</a>, <a href="https://publications.waset.org/search?q=N.%20Alsowaidi"> N. Alsowaidi</a>, <a href="https://publications.waset.org/search?q=M.%20R.%20Mokhtar"> M. R. Mokhtar</a>, <a href="https://publications.waset.org/search?q=Malek%20Harbawi"> Malek Harbawi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Multiple User Interference (MUI) considers the primary problem in Optical Code-Division Multiple Access (OCDMA), which resulting from the overlapping among the users. In this article we aim to mitigate this problem by studying an interference cancellation scheme called successive interference cancellation (SIC) scheme. This scheme will be tested on two different detection schemes, spectral amplitude coding (SAC) and direct detection systems (DS), using partial modified prime (PMP) as the signature codes. It was found that SIC scheme based on both SAC and DS methods had a potential to suppress the intensity noise, that is to say it can mitigate MUI noise. Furthermore, SIC/DS scheme showed much lower bit error rate (BER) performance relative to SIC/SAC scheme for different magnitude of effective power. Hence, many more users can be supported by SIC/DS receiver system. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Multiple%20User%20Interference%20%28MUI%29" title="Multiple User Interference (MUI)">Multiple User Interference (MUI)</a>, <a href="https://publications.waset.org/search?q=Optical%20Code-Division%20Multiple%20Access%20%28OCDMA%29" title=" Optical Code-Division Multiple Access (OCDMA)"> Optical Code-Division Multiple Access (OCDMA)</a>, <a href="https://publications.waset.org/search?q=Partial%20Modified%20Prime%20Code%0D%0A%28PMP%29" title=" Partial Modified Prime Code (PMP)"> Partial Modified Prime Code (PMP)</a>, <a href="https://publications.waset.org/search?q=Spectral%20Amplitude%20Coding%20%28SAC%29" title=" Spectral Amplitude Coding (SAC)"> Spectral Amplitude Coding (SAC)</a>, <a href="https://publications.waset.org/search?q=Successive%20Interference%0D%0ACancellation%20%28SIC%29." title=" Successive Interference Cancellation (SIC)."> Successive Interference Cancellation (SIC).</a> </p> <a href="https://publications.waset.org/10002088/reduction-of-multiple-user-interference-for-optical-cdma-systems-using-successive-interference-cancellation-scheme" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10002088/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10002088/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10002088/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10002088/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10002088/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10002088/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10002088/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10002088/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10002088/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10002088/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10002088.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1731</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1365</span> Optimal and Generalized Multiple Descriptions Image Coding Transform in the Wavelet Domain</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Bahi%20brahim">Bahi brahim</a>, <a href="https://publications.waset.org/search?q=El%20hassane%20Ibn%20Elhaj"> El hassane Ibn Elhaj</a>, <a href="https://publications.waset.org/search?q=Driss%20Aboutajdine"> Driss Aboutajdine</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this paper we propose a Multiple Description Image Coding(MDIC) scheme to generate two compressed and balanced rates descriptions in the wavelet domain (Daubechies biorthogonal (9, 7) wavelet) using pairwise correlating transform optimal and application method for Generalized Multiple Description Coding (GMDC) to image coding in the wavelet domain. The GMDC produces statistically correlated streams such that lost streams can be estimated from the received data. Our performance test shown that the proposed method gives more improvement and good quality of the reconstructed image when the wavelet coefficients are normalized by Gaussian Scale Mixture (GSM) model then the Gaussian one ,.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Multiple%20description%20coding%20%28MDC%29" title="Multiple description coding (MDC)">Multiple description coding (MDC)</a>, <a href="https://publications.waset.org/search?q=gaussian%20scale%20mixture%20%28GSM%29%20model" title=" gaussian scale mixture (GSM) model"> gaussian scale mixture (GSM) model</a>, <a href="https://publications.waset.org/search?q=joint%20source-channel%20coding" title=" joint source-channel coding"> joint source-channel coding</a>, <a href="https://publications.waset.org/search?q=pairwise%20correlating%20transform" title=" pairwise correlating transform"> pairwise correlating transform</a>, <a href="https://publications.waset.org/search?q=GMDCT." title=" GMDCT."> GMDCT.</a> </p> <a href="https://publications.waset.org/8699/optimal-and-generalized-multiple-descriptions-image-coding-transform-in-the-wavelet-domain" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/8699/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/8699/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/8699/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/8699/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/8699/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/8699/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/8699/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/8699/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/8699/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/8699/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/8699.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1618</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1364</span> Network Coding-based ARQ scheme with Overlapping Selection for Resource Limited Multicast/Broadcast Services</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Jung-Hyun%20Kim">Jung-Hyun Kim</a>, <a href="https://publications.waset.org/search?q=Jihyung%20Kim"> Jihyung Kim</a>, <a href="https://publications.waset.org/search?q=Kwangjae%20Lim"> Kwangjae Lim</a>, <a href="https://publications.waset.org/search?q=Dong%20Seung%20Kwon"> Dong Seung Kwon</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Network coding has recently attracted attention as an efficient technique in multicast/broadcast services. The problem of finding the optimal network coding mechanism maximizing the bandwidth efficiency is hard to solve and hard to approximate. Lots of network coding-based schemes have been suggested in the literature to improve the bandwidth efficiency, especially network coding-based automatic repeat request (NCARQ) schemes. However, existing schemes have several limitations which cause the performance degradation in resource limited systems. To improve the performance in resource limited systems, we propose NCARQ with overlapping selection (OS-NCARQ) scheme. The advantages of OS-NCARQ scheme over the traditional ARQ scheme and existing NCARQ schemes are shown through the analysis and simulations.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=ARQ" title="ARQ">ARQ</a>, <a href="https://publications.waset.org/search?q=Network%20coding" title=" Network coding"> Network coding</a>, <a href="https://publications.waset.org/search?q=Multicast%2FBroadcast%20services" title=" Multicast/Broadcast services"> Multicast/Broadcast services</a>, <a href="https://publications.waset.org/search?q=Packet-based%20systems." title=" Packet-based systems."> Packet-based systems.</a> </p> <a href="https://publications.waset.org/9942/network-coding-based-arq-scheme-with-overlapping-selection-for-resource-limited-multicastbroadcast-services" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9942/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9942/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9942/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9942/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9942/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9942/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9942/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9942/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9942/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9942/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9942.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1511</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1363</span> Optimal Power Allocation for the Proposed Asymmetric Turbo Code for 3G Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=K.%20Ramasamy">K. Ramasamy</a>, <a href="https://publications.waset.org/search?q=B.%20Balamuralithara"> B. Balamuralithara</a>, <a href="https://publications.waset.org/search?q=Mohammad%20Umar%20Siddiqi"> Mohammad Umar Siddiqi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>We proposed a new class of asymmetric turbo encoder for 3G systems that performs well in both “water fall" and “error floor" regions in [7]. In this paper, a modified (optimal) power allocation scheme for the different bits of new class of asymmetric turbo encoder has been investigated to enhance the performance. The simulation results and performance bound for proposed asymmetric turbo code with modified Unequal Power Allocation (UPA) scheme for the frame length, N=400, code rate, r=1/3 with Log-MAP decoder over Additive White Gaussian Noise (AWGN) channel are obtained and compared with the system with typical UPA and without UPA. The performance tests are extended over AWGN channel for different frame size to verify the possibility of implementation of the modified UPA scheme for the proposed asymmetric turbo code. From the performance results, it is observed that the proposed asymmetric turbo code with modified UPA performs better than the system without UPA and with typical UPA and it provides a coding gain of 0.4 to 0.52dB.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Asymmetric%20turbo%20code" title="Asymmetric turbo code">Asymmetric turbo code</a>, <a href="https://publications.waset.org/search?q=Generator%20polynomial" title=" Generator polynomial"> Generator polynomial</a>, <a href="https://publications.waset.org/search?q=Interleaver" title="Interleaver">Interleaver</a>, <a href="https://publications.waset.org/search?q=UPA" title=" UPA"> UPA</a>, <a href="https://publications.waset.org/search?q=WCDMA" title=" WCDMA"> WCDMA</a>, <a href="https://publications.waset.org/search?q=cdma2000." title=" cdma2000."> cdma2000.</a> </p> <a href="https://publications.waset.org/15255/optimal-power-allocation-for-the-proposed-asymmetric-turbo-code-for-3g-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15255/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15255/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15255/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15255/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15255/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15255/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15255/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15255/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15255/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15255/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15255.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1889</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1362</span> Low Computational Image Compression Scheme based on Absolute Moment Block Truncation Coding</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=K.Somasundaram">K.Somasundaram</a>, <a href="https://publications.waset.org/search?q=I.Kaspar%20Raj"> I.Kaspar Raj</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper we have proposed three and two stage still gray scale image compressor based on BTC. In our schemes, we have employed a combination of four techniques to reduce the bit rate. They are quad tree segmentation, bit plane omission, bit plane coding using 32 visual patterns and interpolative bit plane coding. The experimental results show that the proposed schemes achieve an average bit rate of 0.46 bits per pixel (bpp) for standard gray scale images with an average PSNR value of 30.25, which is better than the results from the exiting similar methods based on BTC. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Bit%20plane" title="Bit plane">Bit plane</a>, <a href="https://publications.waset.org/search?q=Block%20Truncation%20Coding" title=" Block Truncation Coding"> Block Truncation Coding</a>, <a href="https://publications.waset.org/search?q=Image%0Acompression" title=" Image compression"> Image compression</a>, <a href="https://publications.waset.org/search?q=lossy%20compression" title=" lossy compression"> lossy compression</a>, <a href="https://publications.waset.org/search?q=quad%20tree%20segmentation" title=" quad tree segmentation"> quad tree segmentation</a> </p> <a href="https://publications.waset.org/8982/low-computational-image-compression-scheme-based-on-absolute-moment-block-truncation-coding" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/8982/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/8982/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/8982/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/8982/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/8982/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/8982/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/8982/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/8982/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/8982/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/8982/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/8982.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1751</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1361</span> Network Coding with Buffer Scheme in Multicast for Broadband Wireless Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Gunasekaran%20Raja">Gunasekaran Raja</a>, <a href="https://publications.waset.org/search?q=Ramkumar%20Jayaraman"> Ramkumar Jayaraman</a>, <a href="https://publications.waset.org/search?q=Rajakumar%20Arul"> Rajakumar Arul</a>, <a href="https://publications.waset.org/search?q=Kottilingam%20Kottursamy"> Kottilingam Kottursamy</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Broadband Wireless Network (BWN) is the promising technology nowadays due to the increased number of smartphones. Buffering scheme using network coding considers the reliability and proper degree distribution in Worldwide interoperability for Microwave Access (WiMAX) multi-hop network. Using network coding, a secure way of transmission is performed which helps in improving throughput and reduces the packet loss in the multicast network. At the outset, improved network coding is proposed in multicast wireless mesh network. Considering the problem of performance overhead, degree distribution makes a decision while performing buffer in the encoding / decoding process. Consequently, BuS (Buffer Scheme) based on network coding is proposed in the multi-hop network. Here the encoding process introduces buffer for temporary storage to transmit packets with proper degree distribution. The simulation results depend on the number of packets received in the encoding/decoding with proper degree distribution using buffering scheme.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Encoding%20and%20decoding" title="Encoding and decoding">Encoding and decoding</a>, <a href="https://publications.waset.org/search?q=buffer" title=" buffer"> buffer</a>, <a href="https://publications.waset.org/search?q=network%20coding" title=" network coding"> network coding</a>, <a href="https://publications.waset.org/search?q=degree%20distribution" title=" degree distribution"> degree distribution</a>, <a href="https://publications.waset.org/search?q=broadband%20wireless%20networks" title=" broadband wireless networks"> broadband wireless networks</a>, <a href="https://publications.waset.org/search?q=multicast." title=" multicast. "> multicast. </a> </p> <a href="https://publications.waset.org/10004530/network-coding-with-buffer-scheme-in-multicast-for-broadband-wireless-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10004530/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10004530/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10004530/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10004530/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10004530/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10004530/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10004530/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10004530/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10004530/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10004530/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10004530.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1740</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1360</span> A New Predictor of Coding Regions in Genomic Sequences using a Combination of Different Approaches</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=An%C3%ADbal%20Rodr%C3%ADguez%20Fuentes">Aníbal Rodríguez Fuentes</a>, <a href="https://publications.waset.org/search?q=Juan%20V.%20Lorenzo%20Ginori"> Juan V. Lorenzo Ginori</a>, <a href="https://publications.waset.org/search?q=Ricardo%20Grau%20%C3%81balo"> Ricardo Grau Ábalo</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Identifying protein coding regions in DNA sequences is a basic step in the location of genes. Several approaches based on signal processing tools have been applied to solve this problem, trying to achieve more accurate predictions. This paper presents a new predictor that improves the efficacy of three techniques that use the Fourier Transform to predict coding regions, and that could be computed using an algorithm that reduces the computation load. Some ideas about the combination of the predictor with other methods are discussed. ROC curves are used to demonstrate the efficacy of the proposed predictor, based on the computation of 25 DNA sequences from three different organisms.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Bioinformatics" title="Bioinformatics">Bioinformatics</a>, <a href="https://publications.waset.org/search?q=Coding%20region%20prediction" title=" Coding region prediction"> Coding region prediction</a>, <a href="https://publications.waset.org/search?q=Computational%20load%20reduction" title=" Computational load reduction"> Computational load reduction</a>, <a href="https://publications.waset.org/search?q=Digital%20Signal%20Processing" title=" Digital Signal Processing"> Digital Signal Processing</a>, <a href="https://publications.waset.org/search?q=Fourier%20Transform." title=" Fourier Transform."> Fourier Transform.</a> </p> <a href="https://publications.waset.org/12297/a-new-predictor-of-coding-regions-in-genomic-sequences-using-a-combination-of-different-approaches" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/12297/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/12297/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/12297/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/12297/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/12297/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/12297/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/12297/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/12297/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/12297/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/12297/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/12297.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">1669</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">&lsaquo;</span></li> <li class="page-item active"><span class="page-link">1</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=built-in-self-test%20modified%20selective%20Huffman%20coding&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=built-in-self-test%20modified%20selective%20Huffman%20coding&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=built-in-self-test%20modified%20selective%20Huffman%20coding&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=built-in-self-test%20modified%20selective%20Huffman%20coding&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=built-in-self-test%20modified%20selective%20Huffman%20coding&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=built-in-self-test%20modified%20selective%20Huffman%20coding&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=built-in-self-test%20modified%20selective%20Huffman%20coding&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=built-in-self-test%20modified%20selective%20Huffman%20coding&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=built-in-self-test%20modified%20selective%20Huffman%20coding&page=10">10</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=built-in-self-test%20modified%20selective%20Huffman%20coding&page=46">46</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=built-in-self-test%20modified%20selective%20Huffman%20coding&page=47">47</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=built-in-self-test%20modified%20selective%20Huffman%20coding&page=2" rel="next">&rsaquo;</a></li> </ul> </div> </main> <footer> <div id="infolinks" class="pt-3 pb-2"> <div class="container"> <div style="background-color:#f5f5f5;" class="p-3"> <div class="row"> <div class="col-md-2"> <ul class="list-unstyled"> About <li><a href="https://waset.org/page/support">About Us</a></li> <li><a href="https://waset.org/page/support#legal-information">Legal</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/WASET-16th-foundational-anniversary.pdf">WASET celebrates its 16th foundational anniversary</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Account <li><a href="https://waset.org/profile">My Account</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Explore <li><a href="https://waset.org/disciplines">Disciplines</a></li> <li><a href="https://waset.org/conferences">Conferences</a></li> <li><a href="https://waset.org/conference-programs">Conference Program</a></li> <li><a href="https://waset.org/committees">Committees</a></li> <li><a href="https://publications.waset.org">Publications</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Research <li><a href="https://publications.waset.org/abstracts">Abstracts</a></li> <li><a href="https://publications.waset.org">Periodicals</a></li> <li><a href="https://publications.waset.org/archive">Archive</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Open Science <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Philosophy.pdf">Open Science Philosophy</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Award.pdf">Open Science Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Society-Open-Science-and-Open-Innovation.pdf">Open Innovation</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Postdoctoral-Fellowship-Award.pdf">Postdoctoral Fellowship Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Scholarly-Research-Review.pdf">Scholarly Research Review</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Support <li><a href="https://waset.org/page/support">Support</a></li> <li><a href="https://waset.org/profile/messages/create">Contact Us</a></li> <li><a href="https://waset.org/profile/messages/create">Report Abuse</a></li> </ul> </div> </div> </div> </div> </div> <div class="container text-center"> <hr style="margin-top:0;margin-bottom:.3rem;"> <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank" class="text-muted small">Creative Commons Attribution 4.0 International License</a> <div id="copy" class="mt-2">© 2024 World Academy of Science, Engineering and Technology</div> </div> </footer> <a href="javascript:" id="return-to-top"><i class="fas fa-arrow-up"></i></a> <div class="modal" id="modal-template"> <div class="modal-dialog"> <div class="modal-content"> <div class="row m-0 mt-1"> <div class="col-md-12"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> </div> </div> <div class="modal-body"></div> </div> </div> </div> <script src="https://cdn.waset.org/static/plugins/jquery-3.3.1.min.js"></script> <script src="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/js/bootstrap.bundle.min.js"></script> <script src="https://cdn.waset.org/static/js/site.js?v=150220211556"></script> <script> jQuery(document).ready(function() { /*jQuery.get("https://publications.waset.org/xhr/user-menu", function (response) { jQuery('#mainNavMenu').append(response); });*/ jQuery.get({ url: "https://publications.waset.org/xhr/user-menu", cache: false }).then(function(response){ jQuery('#mainNavMenu').append(response); }); }); </script> </body> </html>