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: Hamming Coding</title> <meta name="description" content="Search results for: Hamming Coding"> <meta name="keywords" content="Hamming 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="Hamming 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="Hamming 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> 293</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: Hamming Coding</h1> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">293</span> Simulation of Hamming Coding and Decoding for Microcontroller Radiation Hardening</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Rehab%20I.%20Abdul%20Rahman">Rehab I. Abdul Rahman</a>, <a href="https://publications.waset.org/search?q=Mazhar%20B.%20Tayel"> Mazhar B. Tayel</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This paper presents a method of hardening the 8051 micro-controller, able to assure reliable operation in the presence of bit flips caused by radiation. Aiming at avoiding such faults in the 8051 micro-controller, Hamming code protection was used in its SRAM memory and registers. A VHDL code has been used for this hamming code protection.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Radiation" title="Radiation">Radiation</a>, <a href="https://publications.waset.org/search?q=hardening" title=" hardening"> hardening</a>, <a href="https://publications.waset.org/search?q=bitflip" title=" bitflip"> bitflip</a>, <a href="https://publications.waset.org/search?q=hamming%20code." title=" hamming code."> hamming code.</a> </p> <a href="https://publications.waset.org/10000673/simulation-of-hamming-coding-and-decoding-for-microcontroller-radiation-hardening" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10000673/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10000673/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10000673/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10000673/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10000673/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10000673/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10000673/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10000673/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10000673/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10000673/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10000673.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">2984</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">292</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">291</span> Error Detection and Correction for Onboard Satellite Computers Using Hamming Code</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Rafsan%20Al%20Mamun">Rafsan Al Mamun</a>, <a href="https://publications.waset.org/search?q=Md.%20Motaharul%20Islam"> Md. Motaharul Islam</a>, <a href="https://publications.waset.org/search?q=Rabana%20Tajrin"> Rabana Tajrin</a>, <a href="https://publications.waset.org/search?q=Nabiha%20Noor"> Nabiha Noor</a>, <a href="https://publications.waset.org/search?q=Shafinaz%20Qader"> Shafinaz Qader</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In an attempt to enrich the lives of billions of people by providing proper information, security and a way of communicating with others, the need for efficient and improved satellites is constantly growing. Thus, there is an increasing demand for better error detection and correction (EDAC) schemes, which are capable of protecting the data onboard the satellites. The paper is aimed towards detecting and correcting such errors using a special algorithm called the Hamming Code, which uses the concept of parity and parity bits to prevent single-bit errors onboard a satellite in Low Earth Orbit. This paper focuses on the study of Low Earth Orbit satellites and the process of generating the Hamming Code matrix to be used for EDAC using computer programs. The most effective version of Hamming Code generated was the Hamming (16, 11, 4) version using MATLAB, and the paper compares this particular scheme with other EDAC mechanisms, including other versions of Hamming Codes and Cyclic Redundancy Check (CRC), and the limitations of this scheme. This particular version of the Hamming Code guarantees single-bit error corrections as well as double-bit error detections. Furthermore, this version of Hamming Code has proved to be fast with a checking time of 5.669 nanoseconds, that has a relatively higher code rate and lower bit overhead compared to the other versions and can detect a greater percentage of errors per length of code than other EDAC schemes with similar capabilities. In conclusion, with the proper implementation of the system, it is quite possible to ensure a relatively uncorrupted satellite storage system.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Bit-flips" title="Bit-flips">Bit-flips</a>, <a href="https://publications.waset.org/search?q=Hamming%20code" title=" Hamming code"> Hamming code</a>, <a href="https://publications.waset.org/search?q=low%20earth%20orbit" title=" low earth orbit"> low earth orbit</a>, <a href="https://publications.waset.org/search?q=parity%20bits" title=" parity bits"> parity bits</a>, <a href="https://publications.waset.org/search?q=satellite" title=" satellite"> satellite</a>, <a href="https://publications.waset.org/search?q=single%20error%20upset." title=" single error upset."> single error upset.</a> </p> <a href="https://publications.waset.org/10011427/error-detection-and-correction-for-onboard-satellite-computers-using-hamming-code" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10011427/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10011427/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10011427/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10011427/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10011427/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10011427/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10011427/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10011427/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10011427/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10011427/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10011427.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">913</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">290</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">289</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">288</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">287</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">286</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">285</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">284</span> Step Height Calibration Using Hamming Window Band-Pass Filter</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Dahi%20Ghareab%20Abdelsalam%20Ibrahim">Dahi Ghareab Abdelsalam Ibrahim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Axial and lateral measurements of a step depth standard are presented. The axial measurement is performed based on the ISO 5436 profile analysis. The lateral measurement is performed based on the Hamming window band-pass filter method. The method is applied to calibrate a groove structure of a step depth standard of 60 nm. For the axial measurement, the computed results show that the depth of the groove structure is 59.7 卤 0.6 nm. For the lateral measurement, the computed results show that the difference between the two line edges of the groove structure is 151.7 卤 2.5 nm. The method can be applied to any step height/depth regardless of the sharpness of the line edges.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Hamming%20window" title="Hamming window">Hamming window</a>, <a href="https://publications.waset.org/search?q=band-pass%20filter" title=" band-pass filter"> band-pass filter</a>, <a href="https://publications.waset.org/search?q=metrology" title=" metrology"> metrology</a>, <a href="https://publications.waset.org/search?q=interferometry." title=" interferometry."> interferometry.</a> </p> <a href="https://publications.waset.org/10013599/step-height-calibration-using-hamming-window-band-pass-filter" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10013599/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10013599/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10013599/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10013599/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10013599/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10013599/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10013599/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10013599/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10013599/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10013599/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10013599.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">105</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">283</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">282</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">281</span> Geometric Operators in the Selection of Human Resources</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Jos%C3%A9%20M.%20Merig%C3%B3">Jos茅 M. Merig贸</a>, <a href="https://publications.waset.org/search?q=Anna%20M.%20Gil-Lafuente"> Anna M. Gil-Lafuente</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We study the possibility of using geometric operators in the selection of human resources. We develop three new methods that use the ordered weighted geometric (OWG) operator in different indexes used for the selection of human resources. The objective of these models is to manipulate the neutrality of the old methods so the decision maker is able to select human resources according to his particular attitude. In order to develop these models, first a short revision of the OWG operator is developed. Second, we briefly explain the general process for the selection of human resources. Then, we develop the three new indexes. They will use the OWG operator in the Hamming distance, in the adequacy coefficient and in the index of maximum and minimum level. Finally, an illustrative example about the new approach is given. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=OWG%20operator" title="OWG operator">OWG operator</a>, <a href="https://publications.waset.org/search?q=decision%20making" title=" decision making"> decision making</a>, <a href="https://publications.waset.org/search?q=human%20resources" title=" human resources"> human resources</a>, <a href="https://publications.waset.org/search?q=Hamming%20distance." title=" Hamming distance."> Hamming distance.</a> </p> <a href="https://publications.waset.org/12892/geometric-operators-in-the-selection-of-human-resources" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/12892/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/12892/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/12892/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/12892/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/12892/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/12892/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/12892/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/12892/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/12892/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/12892/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/12892.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">1402</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">280</span> Reducing Power in Error Correcting Code using Genetic Algorithm </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Heesung%20Lee">Heesung Lee</a>, <a href="https://publications.waset.org/search?q=Joonkyung%20Sung"> Joonkyung Sung</a>, <a href="https://publications.waset.org/search?q=Euntai%20Kim">Euntai Kim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper proposes a method which reduces power consumption in single-error correcting, double error-detecting checker circuits that perform memory error correction code. Power is minimized with little or no impact on area and delay, using the degrees of freedom in selecting the parity check matrix of the error correcting codes. The genetic algorithm is employed to solve the non linear power optimization problem. The method is applied to two commonly used SEC-DED codes: standard Hamming and odd column weight Hsiao codes. Experiments were performed to show the performance of the proposed method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Error%20correcting%20codes" title="Error correcting codes">Error correcting codes</a>, <a href="https://publications.waset.org/search?q=genetic%20algorithm" title=" genetic algorithm"> genetic algorithm</a>, <a href="https://publications.waset.org/search?q=non-linearpower%20optimization" title=" non-linearpower optimization"> non-linearpower optimization</a>, <a href="https://publications.waset.org/search?q=Hamming%20code" title=" Hamming code"> Hamming code</a>, <a href="https://publications.waset.org/search?q=Hsiao%20code." title=" Hsiao code."> Hsiao code.</a> </p> <a href="https://publications.waset.org/13769/reducing-power-in-error-correcting-code-using-genetic-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/13769/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/13769/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/13769/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/13769/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/13769/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/13769/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/13769/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/13769/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/13769/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/13769/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/13769.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">2185</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">279</span> Finding Approximate Tandem Repeats with the Burrows-Wheeler Transform</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Agnieszka%20Danek">Agnieszka Danek</a>, <a href="https://publications.waset.org/search?q=Rafa%C5%82%20Pokrzywa"> Rafa艂 Pokrzywa</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Approximate tandem repeats in a genomic sequence are two or more contiguous, similar copies of a pattern of nucleotides. They are used in DNA mapping, studying molecular evolution mechanisms, forensic analysis and research in diagnosis of inherited diseases. All their functions are still investigated and not well defined, but increasing biological databases together with tools for identification of these repeats may lead to discovery of their specific role or correlation with particular features. This paper presents a new approach for finding approximate tandem repeats in a given sequence, where the similarity between consecutive repeats is measured using the Hamming distance. It is an enhancement of a method for finding exact tandem repeats in DNA sequences based on the Burrows- Wheeler transform. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=approximate%20tandem%20repeats" title="approximate tandem repeats">approximate tandem repeats</a>, <a href="https://publications.waset.org/search?q=Burrows-Wheeler%20transform" title=" Burrows-Wheeler transform"> Burrows-Wheeler transform</a>, <a href="https://publications.waset.org/search?q=Hamming%20distance" title=" Hamming distance"> Hamming distance</a>, <a href="https://publications.waset.org/search?q=suffix%20array" title=" suffix array"> suffix array</a> </p> <a href="https://publications.waset.org/1524/finding-approximate-tandem-repeats-with-the-burrows-wheeler-transform" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/1524/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/1524/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/1524/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/1524/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/1524/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/1524/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/1524/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/1524/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/1524/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/1524/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/1524.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">1536</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">278</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">277</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">276</span> Systematic Unit-Memory Binary Convolutional Codes from Linear Block Codes over F2r + vF2r</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=John%20Mark%20Lampos">John Mark Lampos</a>, <a href="https://publications.waset.org/search?q=Virgilio%20Sison"> Virgilio Sison</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Two constructions of unit-memory binary convolutional codes from linear block codes over the finite semi-local ring F2r +vF2r , where v2 = v, are presented. In both cases, if the linear block code is systematic, then the resulting convolutional encoder is systematic, minimal, basic and non-catastrophic. The Hamming free distance of the convolutional code is bounded below by the minimum Hamming distance of the block code. New examples of binary convolutional codes that meet the Heller upper bound for systematic codes are given. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Convolutional%20codes" title="Convolutional codes">Convolutional codes</a>, <a href="https://publications.waset.org/search?q=semi-local%20ring" title=" semi-local ring"> semi-local ring</a>, <a href="https://publications.waset.org/search?q=free%20distance" title=" free distance"> free distance</a>, <a href="https://publications.waset.org/search?q=Heller%20bound." title="Heller bound.">Heller bound.</a> </p> <a href="https://publications.waset.org/9501/systematic-unit-memory-binary-convolutional-codes-from-linear-block-codes-over-f2r-vf2r" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9501/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9501/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9501/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9501/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9501/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9501/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9501/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9501/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9501/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9501/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9501.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">1652</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">275</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">274</span> A Power Reduction Technique for Built-In-Self Testing Using Modified Linear Feedback Shift Register</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Mayank%20Shakya">Mayank Shakya</a>, <a href="https://publications.waset.org/search?q=Soundra%20Pandian.%20K.%20K"> Soundra Pandian. K. K</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A linear feedback shift register (LFSR) is proposed which targets to reduce the power consumption from within. It reduces the power consumption during testing of a Circuit Under Test (CUT) at two stages. At first stage, Control Logic (CL) makes the clocks of the switching units of the register inactive for a time period when output from them is going to be same as previous one and thus reducing unnecessary switching of the flip-flops. And at second stage, the LFSR reorders the test vectors by interchanging the bit with its next and closest neighbor bit. It keeps fault coverage capacity of the vectors unchanged but reduces the Total Hamming Distance (THD) so that there is reduction in power while shifting operation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Linear%20Feedback%20Shift%20Register" title="Linear Feedback Shift Register">Linear Feedback Shift Register</a>, <a href="https://publications.waset.org/search?q=Total%20Hamming%20Distance" title=" Total Hamming Distance"> Total Hamming Distance</a>, <a href="https://publications.waset.org/search?q=Fault%20Coverage" title=" Fault Coverage"> Fault Coverage</a>, <a href="https://publications.waset.org/search?q=Control%20Logic" title=" Control Logic"> Control Logic</a> </p> <a href="https://publications.waset.org/6299/a-power-reduction-technique-for-built-in-self-testing-using-modified-linear-feedback-shift-register" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/6299/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/6299/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/6299/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/6299/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/6299/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/6299/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/6299/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/6299/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/6299/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/6299/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/6299.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">2026</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">273</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">272</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">271</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">270</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">269</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> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">268</span> GPU Based High Speed Error Protection for Watermarked Medical Image Transmission</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Md%20Shohidul%20Islam">Md Shohidul Islam</a>, <a href="https://publications.waset.org/search?q=Jongmyon%20Kim"> Jongmyon Kim</a>, <a href="https://publications.waset.org/search?q=Ui-pil%20Chong"> Ui-pil Chong</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Medical image is an integral part of e-health care and e-diagnosis system. Medical image watermarking is widely used to protect patients’ information from malicious alteration and manipulation. The watermarked medical images are transmitted over the internet among patients, primary and referred physicians. The images are highly prone to corruption in the wireless transmission medium due to various noises, deflection, and refractions. Distortion in the received images leads to faulty watermark detection and inappropriate disease diagnosis. To address the issue, this paper utilizes error correction code (ECC) with (8, 4) Hamming code in an existing watermarking system. In addition, we implement the high complex ECC on a graphics processing units (GPU) to accelerate and support real-time requirement. Experimental results show that GPU achieves considerable speedup over the sequential CPU implementation, while maintaining 100% ECC efficiency.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Medical%20Image%20Watermarking%20%28MIW%29" title="Medical Image Watermarking (MIW)">Medical Image Watermarking (MIW)</a>, <a href="https://publications.waset.org/search?q=e-health%20system" title=" e-health system"> e-health system</a>, <a href="https://publications.waset.org/search?q=error%20correction" title=" error correction"> error correction</a>, <a href="https://publications.waset.org/search?q=Hamming%20code" title=" Hamming code"> Hamming code</a>, <a href="https://publications.waset.org/search?q=GPU." title=" GPU."> GPU.</a> </p> <a href="https://publications.waset.org/9997718/gpu-based-high-speed-error-protection-for-watermarked-medical-image-transmission" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9997718/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9997718/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9997718/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9997718/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9997718/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9997718/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9997718/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9997718/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9997718/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9997718/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9997718.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">1744</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">267</span> Improving Image Quality in Remote Sensing Satellites using Channel Coding</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=H.%20M.%20Behairy">H. M. Behairy</a>, <a href="https://publications.waset.org/search?q=M.%20S.%20Khorsheed"> M. S. Khorsheed</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Among other factors that characterize satellite communication channels is their high bit error rate. We present a system for still image transmission over noisy satellite channels. The system couples image compression together with error control codes to improve the received image quality while maintaining its bandwidth requirements. The proposed system is tested using a high resolution satellite imagery simulated over the Rician fading channel. Evaluation results show improvement in overall system including image quality and bandwidth requirements compared to similar systems with different coding schemes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Image%20Transmission" title="Image Transmission">Image Transmission</a>, <a href="https://publications.waset.org/search?q=Image%20Compression" title=" Image Compression"> Image Compression</a>, <a href="https://publications.waset.org/search?q=Channel%0ACoding" title=" Channel Coding"> Channel Coding</a>, <a href="https://publications.waset.org/search?q=Error-Control%20Coding" title=" Error-Control Coding"> Error-Control Coding</a>, <a href="https://publications.waset.org/search?q=DCT" title=" DCT"> DCT</a>, <a href="https://publications.waset.org/search?q=Convolution%20Codes" title=" Convolution Codes"> Convolution Codes</a>, <a href="https://publications.waset.org/search?q=Viterbi%0AAlgorithm" title=" Viterbi Algorithm"> Viterbi Algorithm</a>, <a href="https://publications.waset.org/search?q=PCGC." title=" PCGC."> PCGC.</a> </p> <a href="https://publications.waset.org/3448/improving-image-quality-in-remote-sensing-satellites-using-channel-coding" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/3448/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/3448/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/3448/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/3448/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/3448/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/3448/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/3448/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/3448/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/3448/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/3448/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/3448.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">1857</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">266</span> Layered Multiple Description Coding For Robust Video Transmission Over Wireless Ad-Hoc Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Joohee%20Kim">Joohee Kim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a video transmission system using layered multiple description (coding (MDC) and multi-path transport for reliable video communications in wireless ad-hoc networks. The proposed MDC extends a quality-scalable H.264/AVC video coding algorithm to generate two independent descriptions. The two descriptions are transmitted over different paths to a receiver in order to alleviate the effect of unstable channel conditions of wireless adhoc networks. If one description is lost due to transmission erros, then the correctly received description is used to estimate the lost information of the corrupted description. The proposed MD coder maintains an adequate video quality as long as both description are not simultaneously lost. Simulation results show that the proposed MD coding combined with multi-path transport system is largely immune to packet losses, and therefore, can be a promising solution for robust video communications over wireless ad-hoc networks. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Multiple%20description%20coding" title="Multiple description coding">Multiple description coding</a>, <a href="https://publications.waset.org/search?q=wireless%20video%20streaming" title=" wireless video streaming"> wireless video streaming</a>, <a href="https://publications.waset.org/search?q=rate%20control." title="rate control.">rate control.</a> </p> <a href="https://publications.waset.org/3908/layered-multiple-description-coding-for-robust-video-transmission-over-wireless-ad-hoc-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/3908/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/3908/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/3908/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/3908/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/3908/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/3908/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/3908/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/3908/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/3908/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/3908/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/3908.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">1444</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">265</span> Hybrid Coding for Animated Polygonal Meshes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Jinghua%20Zhang">Jinghua Zhang</a>, <a href="https://publications.waset.org/search?q=Charles%20B.%20Owen"> Charles B. Owen</a>, <a href="https://publications.waset.org/search?q=Jinsheng%20Xu"> Jinsheng Xu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A new hybrid coding method for compressing animated polygonal meshes is presented. This paper assumes the simplistic representation of the geometric data: a temporal sequence of polygonal meshes for each discrete frame of the animated sequence. The method utilizes a delta coding and an octree-based method. In this hybrid method, both the octree approach and the delta coding approach are applied to each single frame in the animation sequence in parallel. The approach that generates the smaller encoded file size is chosen to encode the current frame. Given the same quality requirement, the hybrid coding method can achieve much higher compression ratio than the octree-only method or the delta-only method. The hybrid approach can represent 3D animated sequences with higher compression factors while maintaining reasonable quality. It is easy to implement and have a low cost encoding process and a fast decoding process, which make it a better choice for real time application. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=animated%20polygonal%20meshes" title="animated polygonal meshes">animated polygonal meshes</a>, <a href="https://publications.waset.org/search?q=compression" title=" compression"> compression</a>, <a href="https://publications.waset.org/search?q=deltacoding" title=" deltacoding"> deltacoding</a>, <a href="https://publications.waset.org/search?q=octree." title=" octree."> octree.</a> </p> <a href="https://publications.waset.org/8936/hybrid-coding-for-animated-polygonal-meshes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/8936/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/8936/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/8936/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/8936/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/8936/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/8936/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/8936/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/8936/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/8936/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/8936/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/8936.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">1468</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">264</span> A Hybrid P2P Storage Scheme Based on Erasure Coding and Replication</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Usman%20Mahmood">Usman Mahmood</a>, <a href="https://publications.waset.org/search?q=Khawaja%20M.%20U.%20Suleman"> Khawaja M. U. Suleman</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>A peer-to-peer storage system has challenges like; peer availability, data protection, churn rate. To address these challenges different redundancy, replacement and repair schemes are used. This paper presents a hybrid scheme of redundancy using replication and erasure coding. We calculate and compare the storage, access, and maintenance costs of our proposed scheme with existing redundancy schemes. For realistic behaviour of peers a trace of live peer-to-peer system is used. The effect of different replication, and repair schemes are also shown. The proposed hybrid scheme performs better than existing double coding hybrid scheme in all metrics and have an improved maintenance cost than hierarchical codes.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Erasure%20Coding" title="Erasure Coding">Erasure Coding</a>, <a href="https://publications.waset.org/search?q=P2P" title=" P2P"> P2P</a>, <a href="https://publications.waset.org/search?q=Redundancy" title=" Redundancy"> Redundancy</a>, <a href="https://publications.waset.org/search?q=Replication." title=" Replication. "> Replication. </a> </p> <a href="https://publications.waset.org/10004046/a-hybrid-p2p-storage-scheme-based-on-erasure-coding-and-replication" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10004046/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10004046/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10004046/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10004046/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10004046/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10004046/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10004046/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10004046/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10004046/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10004046/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10004046.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">1743</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=Hamming%20Coding&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Hamming%20Coding&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Hamming%20Coding&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Hamming%20Coding&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Hamming%20Coding&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Hamming%20Coding&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Hamming%20Coding&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Hamming%20Coding&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Hamming%20Coding&page=10">10</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=Hamming%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>