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: symmetric half-plane digital filter</title> <meta name="description" content="Search results for: symmetric half-plane digital filter"> <meta name="keywords" content="symmetric half-plane digital filter"> <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="symmetric half-plane digital filter" 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/abstracts/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="symmetric half-plane digital filter"> <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> 3797</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: symmetric half-plane digital filter</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3797</span> Two-Dimensional Symmetric Half-Plane Recursive Doubly Complementary Digital Lattice Filters</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ju-Hong%20Lee">Ju-Hong Lee</a>, <a href="https://publications.waset.org/abstracts/search?q=Chong-Jia%20Ciou"> Chong-Jia Ciou</a>, <a href="https://publications.waset.org/abstracts/search?q=Yuan-Hau%20Yang"> Yuan-Hau Yang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper deals with the problem of two-dimensional (2-D) recursive doubly complementary (DC) digital filter design. We present a structure of 2-D recursive DC filters by using 2-D symmetric half-plane (SHP) recursive digital all-pass lattice filters (DALFs). The novelty of using 2-D SHP recursive DALFs to construct a 2-D recursive DC digital lattice filter is that the resulting 2-D SHP recursive DC digital lattice filter provides better performance than the existing 2-D SHP recursive DC digital filter. Moreover, the proposed structure possesses a favorable 2-D DC half-band (DC-HB) property that allows about half of the 2-D SHP recursive DALF’s coefficients to be zero. This leads to considerable savings in computational burden for implementation. To ensure the stability of a designed 2-D SHP recursive DC digital lattice filter, some necessary constraints on the phase of the 2-D SHP recursive DALF during the design process are presented. Design of a 2-D diamond-shape decimation/interpolation filter is presented for illustration and comparison. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=all-pass%20digital%20filter" title="all-pass digital filter">all-pass digital filter</a>, <a href="https://publications.waset.org/abstracts/search?q=doubly%20complementary" title=" doubly complementary"> doubly complementary</a>, <a href="https://publications.waset.org/abstracts/search?q=lattice%20structure" title=" lattice structure"> lattice structure</a>, <a href="https://publications.waset.org/abstracts/search?q=symmetric%20half-plane%20digital%20filter" title=" symmetric half-plane digital filter"> symmetric half-plane digital filter</a>, <a href="https://publications.waset.org/abstracts/search?q=sampling%20rate%20conversion" title=" sampling rate conversion"> sampling rate conversion</a> </p> <a href="https://publications.waset.org/abstracts/40663/two-dimensional-symmetric-half-plane-recursive-doubly-complementary-digital-lattice-filters" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/40663.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">437</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3796</span> Design of Two-Channel Quincunx Quadrature Mirror Filter Banks Using Digital All-Pass Lattice Filters</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ju-Hong%20Lee">Ju-Hong Lee</a>, <a href="https://publications.waset.org/abstracts/search?q=Chong-Jia%20Ciou"> Chong-Jia Ciou</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper deals with the problem of two-dimensional (2-D) recursive two-channel quincunx quadrature mirror filter (QQMF) banks design. The analysis and synthesis filters of the 2-D recursive QQMF bank are composed of 2-D recursive digital allpass lattice filters (DALFs) with symmetric half-plane (SHP) support regions. Using the 2-D doubly complementary half-band (DC-HB) property possessed by the analysis and synthesis filters, we facilitate the design of the proposed QQMF bank. For finding the coefficients of the 2-D recursive SHP DALFs, we present a structure of 2-D recursive digital allpass filters by using 2-D SHP recursive digital all-pass lattice filters (DALFs). The novelty of using 2-D SHP recursive DALFs to construct a 2-D recursive QQMF bank is that the resulting 2-D recursive QQMF bank provides better performance than the existing 2-D recursive QQMF banks. Simulation results are also presented for illustration and comparison. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=all-pass%20digital%20filter" title="all-pass digital filter">all-pass digital filter</a>, <a href="https://publications.waset.org/abstracts/search?q=lattice%20structure" title=" lattice structure"> lattice structure</a>, <a href="https://publications.waset.org/abstracts/search?q=quincunx%20QMF%20bank" title=" quincunx QMF bank"> quincunx QMF bank</a>, <a href="https://publications.waset.org/abstracts/search?q=symmetric%20half-plane%20digital%20filter" title=" symmetric half-plane digital filter"> symmetric half-plane digital filter</a> </p> <a href="https://publications.waset.org/abstracts/58323/design-of-two-channel-quincunx-quadrature-mirror-filter-banks-using-digital-all-pass-lattice-filters" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/58323.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">359</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3795</span> Frequency Transformation with Pascal Matrix Equations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Phuoc%20Si%20Nguyen">Phuoc Si Nguyen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Frequency transformation with Pascal matrix equations is a method for transforming an electronic filter (analogue or digital) into another filter. The technique is based on frequency transformation in the s-domain, bilinear z-transform with pre-warping frequency, inverse bilinear transformation and a very useful application of the Pascal’s triangle that simplifies computing and enables calculation by hand when transforming from one filter to another. This paper will introduce two methods to transform a filter into a digital filter: frequency transformation from the s-domain into the z-domain; and frequency transformation in the z-domain. Further, two Pascal matrix equations are derived: an analogue to digital filter Pascal matrix equation and a digital to digital filter Pascal matrix equation. These are used to design a desired digital filter from a given filter. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=frequency%20transformation" title="frequency transformation">frequency transformation</a>, <a href="https://publications.waset.org/abstracts/search?q=bilinear%20z-transformation" title=" bilinear z-transformation"> bilinear z-transformation</a>, <a href="https://publications.waset.org/abstracts/search?q=pre-warping%20frequency" title=" pre-warping frequency"> pre-warping frequency</a>, <a href="https://publications.waset.org/abstracts/search?q=digital%20filters" title=" digital filters"> digital filters</a>, <a href="https://publications.waset.org/abstracts/search?q=analog%20filters" title=" analog filters"> analog filters</a>, <a href="https://publications.waset.org/abstracts/search?q=pascal%E2%80%99s%20triangle" title=" pascal鈥檚 triangle"> pascal鈥檚 triangle</a> </p> <a href="https://publications.waset.org/abstracts/34866/frequency-transformation-with-pascal-matrix-equations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/34866.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">549</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3794</span> Optimization of Multiplier Extraction Digital Filter On FPGA</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shiksha%20Jain">Shiksha Jain</a>, <a href="https://publications.waset.org/abstracts/search?q=Ramesh%20Mishra"> Ramesh Mishra</a> </p> <p class="card-text"><strong>Abstract:</strong></p> One of the most widely used complex signals processing operation is filtering. The most important FIR digital filter are widely used in DSP for filtering to alter the spectrum according to some given specifications. Power consumption and Area complexity in the algorithm of Finite Impulse Response (FIR) filter is mainly caused by multipliers. So we present a multiplier less technique (DA technique). In this technique, precomputed value of inner product is stored in LUT. Which are further added and shifted with number of iterations equal to the precision of input sample. But the exponential growth of LUT with the order of FIR filter, in this basic structure, makes it prohibitive for many applications. The significant area and power reduction over traditional Distributed Arithmetic (DA) structure is presented in this paper, by the use of slicing of LUT to the desired length. An architecture of 16 tap FIR filter is presented, with different length of slice of LUT. The result of FIR Filter implementation on Xilinx ISE synthesis tool (XST) vertex-4 FPGA Tool by using proposed method shows the increase of the maximum frequency, the decrease of the resources as usage saving in area with more number of slices and the reduction dynamic power. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=multiplier%20less%20technique" title="multiplier less technique">multiplier less technique</a>, <a href="https://publications.waset.org/abstracts/search?q=linear%20phase%20symmetric%20FIR%20filter" title=" linear phase symmetric FIR filter"> linear phase symmetric FIR filter</a>, <a href="https://publications.waset.org/abstracts/search?q=FPGA%20tool" title=" FPGA tool"> FPGA tool</a>, <a href="https://publications.waset.org/abstracts/search?q=look%20up%20table" title=" look up table"> look up table</a> </p> <a href="https://publications.waset.org/abstracts/17093/optimization-of-multiplier-extraction-digital-filter-on-fpga" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/17093.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">390</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3793</span> Infinite Impulse Response Digital Filters Design</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Phuoc%20Si%20Nguyen">Phuoc Si Nguyen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Infinite impulse response (IIR) filters can be designed from an analogue low pass prototype by using frequency transformation in the s-domain and bilinear z-transformation with pre-warping frequency; this method is known as frequency transformation from the s-domain to the z-domain. This paper will introduce a new method to transform an IIR digital filter to another type of IIR digital filter (low pass, high pass, band pass, band stop or narrow band) using a technique based on inverse bilinear z-transformation and inverse matrices. First, a matrix equation is derived from inverse bilinear z-transformation and Pascal鈥檚 triangle. This Low Pass Digital to Digital Filter Pascal Matrix Equation is used to transform a low pass digital filter to other digital filter types. From this equation and the inverse matrix, a Digital to Digital Filter Pascal Matrix Equation can be derived that is able to transform any IIR digital filter. This paper will also introduce some specific matrices to replace the inverse matrix, which is difficult to determine due to the larger size of the matrix in the current method. This will make computing and hand calculation easier when transforming from one IIR digital filter to another in the digital domain. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bilinear%20z-transformation" title="bilinear z-transformation">bilinear z-transformation</a>, <a href="https://publications.waset.org/abstracts/search?q=frequency%20transformation" title=" frequency transformation"> frequency transformation</a>, <a href="https://publications.waset.org/abstracts/search?q=inverse%20bilinear%20z-transformation" title=" inverse bilinear z-transformation"> inverse bilinear z-transformation</a>, <a href="https://publications.waset.org/abstracts/search?q=IIR%20digital%20filters" title=" IIR digital filters"> IIR digital filters</a> </p> <a href="https://publications.waset.org/abstracts/48777/infinite-impulse-response-digital-filters-design" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/48777.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">423</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3792</span> Design of Wide-Range Variable Fractional-Delay FIR Digital Filters</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jong-Jy%20Shyu">Jong-Jy Shyu</a>, <a href="https://publications.waset.org/abstracts/search?q=Soo-Chang%20Pei"> Soo-Chang Pei</a>, <a href="https://publications.waset.org/abstracts/search?q=Yun-Da%20Huang"> Yun-Da Huang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, design of wide-range variable fractional-delay (WR-VFD) finite impulse response (FIR) digital filters is proposed. With respect to the conventional VFD filter which is designed such that its delay is adjustable within one unit, the proposed VFD FIR filter is designed such that its delay can be tunable within a wider range. By the traces of coefficients of the fractional-delay FIR filter, it is found that the conventional method of polynomial substitution for filter coefficients no longer satisfies the design demand, and the circuits perform the sinc function (sinc converter) are added to overcome this problem. In this paper, least-squares method is adopted to design WR-VFD FIR filter. Throughout this paper, several examples will be proposed to demonstrate the effectiveness of the presented methods. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=digital%20filter" title="digital filter">digital filter</a>, <a href="https://publications.waset.org/abstracts/search?q=FIR%20filter" title=" FIR filter"> FIR filter</a>, <a href="https://publications.waset.org/abstracts/search?q=variable%20fractional-delay%20%28VFD%29%20filter" title=" variable fractional-delay (VFD) filter"> variable fractional-delay (VFD) filter</a>, <a href="https://publications.waset.org/abstracts/search?q=least-squares%20approximation" title=" least-squares approximation"> least-squares approximation</a> </p> <a href="https://publications.waset.org/abstracts/8390/design-of-wide-range-variable-fractional-delay-fir-digital-filters" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/8390.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">491</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3791</span> An Efficient Digital Baseband ASIC for Wireless Biomedical Signals Monitoring</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kah-Hyong%20Chang">Kah-Hyong Chang</a>, <a href="https://publications.waset.org/abstracts/search?q=Xin%20Liu"> Xin Liu</a>, <a href="https://publications.waset.org/abstracts/search?q=Jia%20Hao%20Cheong"> Jia Hao Cheong</a>, <a href="https://publications.waset.org/abstracts/search?q=Saisundar%20Sankaranarayanan"> Saisundar Sankaranarayanan</a>, <a href="https://publications.waset.org/abstracts/search?q=Dexing%20Pang"> Dexing Pang</a>, <a href="https://publications.waset.org/abstracts/search?q=Hongzhao%20Zheng"> Hongzhao Zheng</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A digital baseband Application-Specific Integrated Circuit (ASIC) is developed for a microchip transponder to transmit signals and temperature levels from biomedical monitoring devices. The transmission protocol is adapted from the ISO/IEC 11784/85 standard. The module has a decimation filter that employs only a single adder-subtractor in its datapath. The filtered output is coded with cyclic redundancy check and transmitted through backscattering Load Shift Keying (LSK) modulation to a reader. Fabricated using the 0.18-渭m CMOS technology, the module occupies 0.116 mm虏 in chip area (digital baseband: 0.060 mm虏, decimation filter: 0.056 mm虏), and consumes a total of less than 0.9 渭W of power (digital baseband: 0.75 渭W, decimation filter: 0.14 渭W). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=biomedical%20sensor" title="biomedical sensor">biomedical sensor</a>, <a href="https://publications.waset.org/abstracts/search?q=decimation%20filter" title=" decimation filter"> decimation filter</a>, <a href="https://publications.waset.org/abstracts/search?q=radio%20frequency%20integrated%20circuit%20%28RFIC%29%20baseband" title=" radio frequency integrated circuit (RFIC) baseband"> radio frequency integrated circuit (RFIC) baseband</a>, <a href="https://publications.waset.org/abstracts/search?q=temperature%20sensor" title=" temperature sensor"> temperature sensor</a> </p> <a href="https://publications.waset.org/abstracts/37886/an-efficient-digital-baseband-asic-for-wireless-biomedical-signals-monitoring" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/37886.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">397</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3790</span> Design of Digital IIR Filter Using Opposition Learning and Artificial Bee Colony Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=J.%20S.%20Dhillon">J. S. Dhillon</a>, <a href="https://publications.waset.org/abstracts/search?q=K.%20K.%20Dhaliwal"> K. K. Dhaliwal</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In almost all the digital filtering applications the digital infinite impulse response (IIR) filters are preferred over finite impulse response (FIR) filters because they provide much better performance, less computational cost and have smaller memory requirements for similar magnitude specifications. However, the digital IIR filters are generally multimodal with respect to the filter coefficients and therefore, reliable methods that can provide global optimal solutions are required. The artificial bee colony (ABC) algorithm is one such recently introduced meta-heuristic optimization algorithm. But in some cases it shows insufficiency while searching the solution space resulting in a weak exchange of information and hence is not able to return better solutions. To overcome this deficiency, the opposition based learning strategy is incorporated in ABC and hence a modified version called oppositional artificial bee colony (OABC) algorithm is proposed in this paper. Duplication of members is avoided during the run which also augments the exploration ability. The developed algorithm is then applied for the design of optimal and stable digital IIR filter structure where design of low-pass (LP) and high-pass (HP) filters is carried out. Fuzzy theory is applied to achieve maximize satisfaction of minimum magnitude error and stability constraints. To check the effectiveness of OABC, the results are compared with some well established filter design techniques and it is observed that in most cases OABC returns better or atleast comparable results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=digital%20infinite%20impulse%20response%20filter" title="digital infinite impulse response filter">digital infinite impulse response filter</a>, <a href="https://publications.waset.org/abstracts/search?q=artificial%20bee%20colony%20optimization" title=" artificial bee colony optimization"> artificial bee colony optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=opposition%20based%20learning" title=" opposition based learning"> opposition based learning</a>, <a href="https://publications.waset.org/abstracts/search?q=digital%20filter%20design" title=" digital filter design"> digital filter design</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-parameter%20optimization" title=" multi-parameter optimization"> multi-parameter optimization</a> </p> <a href="https://publications.waset.org/abstracts/33966/design-of-digital-iir-filter-using-opposition-learning-and-artificial-bee-colony-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/33966.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">477</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3789</span> Microstrip Bandpass Filter with Wide Stopband and High Out-of-Band Rejection Based on Inter-Digital Capacitor</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohamad%20Farhat">Mohamad Farhat</a>, <a href="https://publications.waset.org/abstracts/search?q=Bal%20Virdee"> Bal Virdee</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper present a compact Microstrip Bandpass filter exhibiting a very wide stop band and high selectivity. The filter comprises of asymmetric resonator structures, which are interconnected by an inter-digital capacitor to enable the realization of a wide bandwidth with high rejection level. High selectivity is obtained by optimizing the parameters of the interdigital capacitor. The filter has high out-of-band rejection (> 30 dB), less than 0.6 dB of insertion-loss, up to 5.5 GHz spurii free, and about 18 dB of return-loss. Full-wave electromagnetic simulator ADSTM (Mom) is used to analyze and optimize the prototype bandpass filter. The proposed technique was verified practically to validate the design methodology. The experimental results of the prototype circuit are presented and a good agreement was obtained comparing with the simulation results. The dimensions of the proposed filter are 32 x 24 mm2.The filter鈥檚 characteristics and compact size make it suitable for wireless communication systems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=asymmetric%20resonator" title="asymmetric resonator">asymmetric resonator</a>, <a href="https://publications.waset.org/abstracts/search?q=bandpass%20filter" title=" bandpass filter"> bandpass filter</a>, <a href="https://publications.waset.org/abstracts/search?q=microstrip" title=" microstrip"> microstrip</a>, <a href="https://publications.waset.org/abstracts/search?q=spurious%20suppression" title=" spurious suppression"> spurious suppression</a>, <a href="https://publications.waset.org/abstracts/search?q=ultra-wide%20stop%20band" title=" ultra-wide stop band"> ultra-wide stop band</a> </p> <a href="https://publications.waset.org/abstracts/89052/microstrip-bandpass-filter-with-wide-stopband-and-high-out-of-band-rejection-based-on-inter-digital-capacitor" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/89052.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">189</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3788</span> Low-Power Digital Filters Design Using a Bypassing Technique</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Thiago%20Brito%20Bezerra">Thiago Brito Bezerra</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a novel approach to reduce power consumption of digital filters based on dynamic bypassing of partial products in their multipliers. The bypassing elements incorporated into the multiplier hardware eliminate redundant signal transitions, which appear within the carry-save adders when the partial product is zero. This technique reduces the power consumption by around 20%. The circuit implementation was made using the AMS 0.18 um technology. The bypassing technique applied to the circuits is outlined. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=digital%20filter" title="digital filter">digital filter</a>, <a href="https://publications.waset.org/abstracts/search?q=low-power" title=" low-power"> low-power</a>, <a href="https://publications.waset.org/abstracts/search?q=bypassing%20technique" title=" bypassing technique"> bypassing technique</a>, <a href="https://publications.waset.org/abstracts/search?q=low-pass%20filter" title=" low-pass filter"> low-pass filter</a> </p> <a href="https://publications.waset.org/abstracts/43364/low-power-digital-filters-design-using-a-bypassing-technique" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/43364.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">381</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3787</span> Recursive Doubly Complementary Filter Design Using Particle Swarm Optimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ju-Hong%20Lee">Ju-Hong Lee</a>, <a href="https://publications.waset.org/abstracts/search?q=Ding-Chen%20Chung"> Ding-Chen Chung</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper deals with the optimal design of recursive doubly complementary (DC) digital filter design using a metaheuristic based optimization technique. Based on the theory of DC digital filters using two recursive digital all-pass filters (DAFs), the design problem is appropriately formulated to result in an objective function which is a weighted sum of the phase response errors of the designed DAFs. To deal with the stability of the recursive DC filters during the design process, we can either impose some necessary constraints on the phases of the recursive DAFs. Through a frequency sampling and a weighted least squares approach, the optimization problem of the objective function can be solved by utilizing a population based stochastic optimization approach. The resulting DC digital filters can possess satisfactory frequency response. Simulation results are presented for illustration and comparison. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=doubly%20complementary" title="doubly complementary">doubly complementary</a>, <a href="https://publications.waset.org/abstracts/search?q=digital%20all-pass%20filter" title=" digital all-pass filter"> digital all-pass filter</a>, <a href="https://publications.waset.org/abstracts/search?q=weighted%20least%20squares%20algorithm" title=" weighted least squares algorithm"> weighted least squares algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=particle%20swarm%20optimization" title=" particle swarm optimization"> particle swarm optimization</a> </p> <a href="https://publications.waset.org/abstracts/12469/recursive-doubly-complementary-filter-design-using-particle-swarm-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/12469.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">688</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3786</span> On the Equalization of Nonminimum Phase Electroacoustic Systems Using Digital Inverse Filters</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Avelino%20Marques">Avelino Marques</a>, <a href="https://publications.waset.org/abstracts/search?q=Diamantino%20Freitas"> Diamantino Freitas</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Some important electroacoustic systems, like loudspeaker systems, exhibit a nonminimum phase behavior that poses considerable effort when applying advanced digital signal processing techniques, such as linear equalization. In this paper, the position and the number of zeros and poles of the inverse filter, FIR type or IIR type, designed using time domain techniques, are studied, compared and related to the nonminimum phase zeros of system to be equalized. Conclusions about the impact of the position of the system non-minimum phase zeros, on the length/order of the inverse filter and on the delay of the equalized system are outlined as a guide to previously decide which type of filter will be more adequate. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=loudspeaker%20systems" title="loudspeaker systems">loudspeaker systems</a>, <a href="https://publications.waset.org/abstracts/search?q=nonminimum%20phase%20system" title=" nonminimum phase system"> nonminimum phase system</a>, <a href="https://publications.waset.org/abstracts/search?q=FIR%20and%20IIR%20filter" title=" FIR and IIR filter"> FIR and IIR filter</a>, <a href="https://publications.waset.org/abstracts/search?q=delay" title=" delay"> delay</a> </p> <a href="https://publications.waset.org/abstracts/173576/on-the-equalization-of-nonminimum-phase-electroacoustic-systems-using-digital-inverse-filters" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/173576.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">77</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3785</span> Some Classes of Lorentzian Alpha-Sasakian Manifolds with Respect to Quarter-Symmetric Metric Connection</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Santu%20Dey">Santu Dey</a>, <a href="https://publications.waset.org/abstracts/search?q=Arindam%20Bhattacharyya"> Arindam Bhattacharyya</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The object of the present paper is to study a quarter-symmetric metric connection in a Lorentzian 伪-Sasakian manifold. We study some curvature properties of Lorentzian 伪-Sasakian manifold with respect to quarter-symmetric metric connection. We investigate quasi-projectively at, 桅-symmetric, 桅-projectively at Lorentzian 伪-Sasakian manifolds with respect to quarter-symmetric metric connection. We also discuss Lorentzian 伪-Sasakian manifold admitting quartersymmetric metric connection satisfying P.S = 0, where P denote the projective curvature tensor with respect to quarter-symmetric metric connection. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=quarter-symmetric%20metric%20connection" title="quarter-symmetric metric connection">quarter-symmetric metric connection</a>, <a href="https://publications.waset.org/abstracts/search?q=Lorentzian%20alpha-Sasakian%20manifold" title=" Lorentzian alpha-Sasakian manifold"> Lorentzian alpha-Sasakian manifold</a>, <a href="https://publications.waset.org/abstracts/search?q=quasi-projectively%20flat%20Lorentzian%20alpha-Sasakian%20manifold" title=" quasi-projectively flat Lorentzian alpha-Sasakian manifold"> quasi-projectively flat Lorentzian alpha-Sasakian manifold</a>, <a href="https://publications.waset.org/abstracts/search?q=phi-symmetric%20manifold" title=" phi-symmetric manifold"> phi-symmetric manifold</a> </p> <a href="https://publications.waset.org/abstracts/66809/some-classes-of-lorentzian-alpha-sasakian-manifolds-with-respect-to-quarter-symmetric-metric-connection" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/66809.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">239</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3784</span> Quadrature Mirror Filter Bank Design Using Population Based Stochastic Optimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ju-Hong%20Lee">Ju-Hong Lee</a>, <a href="https://publications.waset.org/abstracts/search?q=Ding-Chen%20Chung"> Ding-Chen Chung</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The paper deals with the optimal design of two-channel linear-phase (LP) quadrature mirror filter (QMF) banks using a metaheuristic based optimization technique. Based on the theory of two-channel QMF banks using two recursive digital all-pass filters (DAFs), the design problem is appropriately formulated to result in an objective function which is a weighted sum of the group delay error of the designed QMF bank and the magnitude response error of the designed low-pass analysis filter. Through a frequency sampling and a weighted least squares approach, the optimization problem of the objective function can be solved by utilizing a particle swarm optimization algorithm. The resulting two-channel QMF banks can possess approximately LP response without magnitude distortion. Simulation results are presented for illustration and comparison. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=quadrature%20mirror%20filter%20bank" title="quadrature mirror filter bank">quadrature mirror filter bank</a>, <a href="https://publications.waset.org/abstracts/search?q=digital%20all-pass%20filter" title=" digital all-pass filter"> digital all-pass filter</a>, <a href="https://publications.waset.org/abstracts/search?q=weighted%20least%20squares%20algorithm" title=" weighted least squares algorithm"> weighted least squares algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=particle%20swarm%20optimization" title=" particle swarm optimization"> particle swarm optimization</a> </p> <a href="https://publications.waset.org/abstracts/6051/quadrature-mirror-filter-bank-design-using-population-based-stochastic-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/6051.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">521</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3783</span> An Efficient FPGA Realization of Fir Filter Using Distributed Arithmetic </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20Iruleswari">M. Iruleswari</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Jeyapaul%20Murugan"> A. Jeyapaul Murugan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Most fundamental part used in many Digital Signal Processing (DSP) application is a Finite Impulse Response (FIR) filter because of its linear phase, stability and regular structure. Designing a high-speed and hardware efficient FIR filter is a very challenging task as the complexity increases with the filter order. In most applications the higher order filters are required but the memory usage of the filter increases exponentially with the order of the filter. Using multipliers occupy a large chip area and need high computation time. Multiplier-less memory-based techniques have gained popularity over past two decades due to their high throughput processing capability and reduced dynamic power consumption. This paper describes the design and implementation of highly efficient Look-Up Table (LUT) based circuit for the implementation of FIR filter using Distributed arithmetic algorithm. It is a multiplier less FIR filter. The LUT can be subdivided into a number of LUT to reduce the memory usage of the LUT for higher order filter. Analysis on the performance of various filter orders with different address length is done using Xilinx 14.5 synthesis tool. The proposed design provides less latency, less memory usage and high throughput. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=finite%20impulse%20response" title="finite impulse response">finite impulse response</a>, <a href="https://publications.waset.org/abstracts/search?q=distributed%20arithmetic" title=" distributed arithmetic"> distributed arithmetic</a>, <a href="https://publications.waset.org/abstracts/search?q=field%20programmable%20gate%20array" title=" field programmable gate array"> field programmable gate array</a>, <a href="https://publications.waset.org/abstracts/search?q=look-up%20table" title=" look-up table"> look-up table</a> </p> <a href="https://publications.waset.org/abstracts/51854/an-efficient-fpga-realization-of-fir-filter-using-distributed-arithmetic" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/51854.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">457</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3782</span> Hybrid Robust Estimation via Median Filter and Wavelet Thresholding with Automatic Boundary Correction</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Alsaidi%20M.%20Altaher">Alsaidi M. Altaher</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohd%20Tahir%20Ismail"> Mohd Tahir Ismail</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Wavelet thresholding has been a power tool in curve estimation and data analysis. In the presence of outliers this non parametric estimator can not suppress the outliers involved. This study proposes a new two-stage combined method based on the use of the median filter as primary step before applying wavelet thresholding. After suppressing the outliers in a signal through the median filter, the classical wavelet thresholding is then applied for removing the remaining noise. We use automatic boundary corrections; using a low order polynomial model or local polynomial model as a more realistic rule to correct the bias at the boundary region; instead of using the classical assumptions such periodic or symmetric. A simulation experiment has been conducted to evaluate the numerical performance of the proposed method. Results show strong evidences that the proposed method is extremely effective in terms of correcting the boundary bias and eliminating outlier鈥檚 sensitivity. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=boundary%20correction" title="boundary correction">boundary correction</a>, <a href="https://publications.waset.org/abstracts/search?q=median%20filter" title=" median filter"> median filter</a>, <a href="https://publications.waset.org/abstracts/search?q=simulation" title=" simulation"> simulation</a>, <a href="https://publications.waset.org/abstracts/search?q=wavelet%20thresholding" title=" wavelet thresholding"> wavelet thresholding</a> </p> <a href="https://publications.waset.org/abstracts/16883/hybrid-robust-estimation-via-median-filter-and-wavelet-thresholding-with-automatic-boundary-correction" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/16883.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">428</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3781</span> Gaussian Particle Flow Bernoulli Filter for Single Target Tracking</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hyeongbok%20Kim">Hyeongbok Kim</a>, <a href="https://publications.waset.org/abstracts/search?q=Lingling%20Zhao"> Lingling Zhao</a>, <a href="https://publications.waset.org/abstracts/search?q=Xiaohong%20Su"> Xiaohong Su</a>, <a href="https://publications.waset.org/abstracts/search?q=Junjie%20Wang"> Junjie Wang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Bernoulli filter is a precise Bayesian filter for single target tracking based on the random finite set theory. The standard Bernoulli filter often underestimates the number of targets. This study proposes a Gaussian particle flow (GPF) Bernoulli filter employing particle flow to migrate particles from prior to posterior positions to improve the performance of the standard Bernoulli filter. By employing the particle flow filter, the computational speed of the Bernoulli filters is significantly improved. In addition, the GPF Bernoulli filter provides a more accurate estimation compared with that of the standard Bernoulli filter. Simulation results confirm the improved tracking performance and computational speed in two- and three-dimensional scenarios compared with other algorithms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bernoulli%20filter" title="Bernoulli filter">Bernoulli filter</a>, <a href="https://publications.waset.org/abstracts/search?q=particle%20filter" title=" particle filter"> particle filter</a>, <a href="https://publications.waset.org/abstracts/search?q=particle%20flow%20filter" title=" particle flow filter"> particle flow filter</a>, <a href="https://publications.waset.org/abstracts/search?q=random%20finite%20sets" title=" random finite sets"> random finite sets</a>, <a href="https://publications.waset.org/abstracts/search?q=target%20tracking" title=" target tracking"> target tracking</a> </p> <a href="https://publications.waset.org/abstracts/162210/gaussian-particle-flow-bernoulli-filter-for-single-target-tracking" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/162210.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">92</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3780</span> A Variant of a Double Structure-Preserving QR Algorithm for Symmetric and Hamiltonian Matrices</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ahmed%20Salam">Ahmed Salam</a>, <a href="https://publications.waset.org/abstracts/search?q=Haithem%20Benkahla"> Haithem Benkahla</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Recently, an efficient backward-stable algorithm for computing eigenvalues and vectors of a symmetric and Hamiltonian matrix has been proposed. The method preserves the symmetric and Hamiltonian structures of the original matrix, during the whole process. In this paper, we revisit the method. We derive a way for implementing the reduction of the matrix to the appropriate condensed form. Then, we construct a novel version of the implicit QR-algorithm for computing the eigenvalues and vectors. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=block%20implicit%20QR%20algorithm" title="block implicit QR algorithm">block implicit QR algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=preservation%20of%20a%20double%20structure" title=" preservation of a double structure"> preservation of a double structure</a>, <a href="https://publications.waset.org/abstracts/search?q=QR%20algorithm" title=" QR algorithm"> QR algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=symmetric%20and%20Hamiltonian%20structures" title=" symmetric and Hamiltonian structures"> symmetric and Hamiltonian structures</a> </p> <a href="https://publications.waset.org/abstracts/61018/a-variant-of-a-double-structure-preserving-qr-algorithm-for-symmetric-and-hamiltonian-matrices" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/61018.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">409</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3779</span> Kalman Filter Gain Elimination in Linear Estimation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nicholas%20D.%20Assimakis">Nicholas D. Assimakis</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In linear estimation, the traditional Kalman filter uses the Kalman filter gain in order to produce estimation and prediction of the n-dimensional state vector using the m-dimensional measurement vector. The computation of the Kalman filter gain requires the inversion of an m x m matrix in every iteration. In this paper, a variation of the Kalman filter eliminating the Kalman filter gain is proposed. In the time varying case, the elimination of the Kalman filter gain requires the inversion of an n x n matrix and the inversion of an m x m matrix in every iteration. In the time invariant case, the elimination of the Kalman filter gain requires the inversion of an n x n matrix in every iteration. The proposed Kalman filter gain elimination algorithm may be faster than the conventional Kalman filter, depending on the model dimensions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=discrete%20time" title="discrete time">discrete time</a>, <a href="https://publications.waset.org/abstracts/search?q=estimation" title=" estimation"> estimation</a>, <a href="https://publications.waset.org/abstracts/search?q=Kalman%20filter" title=" Kalman filter"> Kalman filter</a>, <a href="https://publications.waset.org/abstracts/search?q=Kalman%20filter%20gain" title=" Kalman filter gain"> Kalman filter gain</a> </p> <a href="https://publications.waset.org/abstracts/123040/kalman-filter-gain-elimination-in-linear-estimation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/123040.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">195</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3778</span> Operation Parameters of Vacuum Cleaned Filters</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Wilhelm%20Hoeflinger">Wilhelm Hoeflinger</a>, <a href="https://publications.waset.org/abstracts/search?q=Thomas%20Laminger"> Thomas Laminger</a>, <a href="https://publications.waset.org/abstracts/search?q=Johannes%20Wolfslehner"> Johannes Wolfslehner</a> </p> <p class="card-text"><strong>Abstract:</strong></p> For vacuum cleaned dust filters, used e. g. in textile industry, there exist no calculation methods to determine design parameters (e. g. traverse speed of the nozzle, filter area...). In this work a method to calculate the optimum traverse speed of the nozzle of an industrial-size flat dust filter at a given mean pressure drop and filter face velocity was elaborated. Well-known equations for the design of a cleanable multi-chamber bag-house-filter were modified in order to take into account a continuously regeneration of a dust filter by a nozzle. Thereby, the specific filter medium resistance and the specific cake resistance values are needed which can be derived from filter tests under constant operation conditions. A lab-scale filter test rig was used to derive the specific filter media resistance value and the specific cake resistance value for vacuum cleaned filter operation. Three different filter media were tested and the determined parameters were compared to each other. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=design%20of%20dust%20filter" title="design of dust filter">design of dust filter</a>, <a href="https://publications.waset.org/abstracts/search?q=dust%20removing" title=" dust removing"> dust removing</a>, <a href="https://publications.waset.org/abstracts/search?q=filter%20regeneration" title=" filter regeneration"> filter regeneration</a>, <a href="https://publications.waset.org/abstracts/search?q=operation%20parameters" title=" operation parameters"> operation parameters</a> </p> <a href="https://publications.waset.org/abstracts/2536/operation-parameters-of-vacuum-cleaned-filters" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/2536.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">388</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3777</span> The Permutation of Symmetric Triangular Equilateral Group in the Cryptography of Private and Public Key</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Fola%20John%20Adeyeye">Fola John Adeyeye</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we propose a cryptosystem private and public key base on symmetric group Pn and validates its theoretical formulation. This proposed system benefits from the algebraic properties of Pn such as noncommutative high logical, computational speed and high flexibility in selecting key which makes the discrete permutation multiplier logic (DPML) resist to attack by any algorithm such as Pohlig-Hellman. One of the advantages of this scheme is that it explore all the possible triangular symmetries. Against these properties, the only disadvantage is that the law of permutation multiplicity only allow an operation from left to right. Many other cryptosystems can be transformed into their symmetric group. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cryptosystem" title="cryptosystem">cryptosystem</a>, <a href="https://publications.waset.org/abstracts/search?q=private%20and%20public%20key" title=" private and public key"> private and public key</a>, <a href="https://publications.waset.org/abstracts/search?q=DPML" title=" DPML"> DPML</a>, <a href="https://publications.waset.org/abstracts/search?q=symmetric%20group%20Pn" title=" symmetric group Pn"> symmetric group Pn</a> </p> <a href="https://publications.waset.org/abstracts/103766/the-permutation-of-symmetric-triangular-equilateral-group-in-the-cryptography-of-private-and-public-key" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/103766.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">202</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3776</span> On Projective Invariants of Spherically Symmetric Finsler Spaces in Rn</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nasrin%20Sadeghzadeh">Nasrin Sadeghzadeh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper we study projective invariants of spherically symmetric Finsler metrics in Rn. We find the necessary and sufficient conditions for the metrics to be Douglas and Generalized Douglas-Weyl (GDW) types. Also we show that two classes of GDW and Douglas spherically symmetric Finsler metrics coincide. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=spherically%20symmetric%20finsler%20metrics%20in%20Rn" title="spherically symmetric finsler metrics in Rn">spherically symmetric finsler metrics in Rn</a>, <a href="https://publications.waset.org/abstracts/search?q=finsler%20metrics" title=" finsler metrics"> finsler metrics</a>, <a href="https://publications.waset.org/abstracts/search?q=douglas%20metric" title=" douglas metric"> douglas metric</a>, <a href="https://publications.waset.org/abstracts/search?q=generalized%0D%0ADouglas-Weyl%20%28GDW%29%20metric" title=" generalized Douglas-Weyl (GDW) metric"> generalized Douglas-Weyl (GDW) metric</a> </p> <a href="https://publications.waset.org/abstracts/33315/on-projective-invariants-of-spherically-symmetric-finsler-spaces-in-rn" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/33315.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">359</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3775</span> Compact Microstrip Ultra-Wideband Bandstop Filter With Quasi-Elliptic Function Response</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hussein%20Shaman">Hussein Shaman</a>, <a href="https://publications.waset.org/abstracts/search?q=Faris%20Almansour"> Faris Almansour</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper proposes a modified optimum bandstop filter with ultra-wideband stopband. The filter consists of three shunt open-circuited stubs and two non-redundant unit elements. The proposed bandstop filter is designed with unequal electrical lengths of the open-circuited stubs at the mid-stopband. Therefore, the filter can exhibit a quasi-elliptic function response that improves the selectivity and enhances the rejection bandwidth. The filter is designed to exhibit a fractional bandwidth of about 114% at a mid-stopband frequency of 3.0 GHz. The filter is successfully realized in theory, simulated, fabricated and measured. An excellent agreement is obtained between calculated, simulated and measured. The fabricated filter has a compact size with a low insertion loss in the passbands, high selectivity and good attenuation level inside the desired stopband <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=microstrip%20filter" title="microstrip filter">microstrip filter</a>, <a href="https://publications.waset.org/abstracts/search?q=bandstop%20filter" title=" bandstop filter"> bandstop filter</a>, <a href="https://publications.waset.org/abstracts/search?q=UWB%20filter" title=" UWB filter"> UWB filter</a>, <a href="https://publications.waset.org/abstracts/search?q=transmission%20line%20filter" title=" transmission line filter"> transmission line filter</a> </p> <a href="https://publications.waset.org/abstracts/151305/compact-microstrip-ultra-wideband-bandstop-filter-with-quasi-elliptic-function-response" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/151305.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">148</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3774</span> Denoising of Motor Unit Action Potential Based on Tunable Band-Pass Filter</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Khalida%20S.%20Rijab">Khalida S. Rijab</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohammed%20E.%20Safi"> Mohammed E. Safi</a>, <a href="https://publications.waset.org/abstracts/search?q=Ayad%20A.%20%20Ibrahim"> Ayad A. Ibrahim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> When electrical electrodes are mounted on the skin surface of the muscle, a signal is detected when a skeletal muscle undergoes contraction; the signal is known as surface electromyographic signal (EMG). This signal has a noise-like interference pattern resulting from the temporal and spatial summation of action potentials (AP) of all active motor units (MU) near electrode detection. By appropriate processing (Decomposition), the surface EMG signal may be used to give an estimate of motor unit action potential. In this work, a denoising technique is applied to the MUAP signals extracted from the spatial filter (IB2). A set of signals from a non-invasive two-dimensional grid of 16 electrodes from different types of subjects, muscles, and sex are recorded. These signals will acquire noise during recording and detection. A digital fourth order band- pass Butterworth filter is used for denoising, with a tuned band-pass frequency of suitable choice of cutoff frequencies is investigated, with the aim of obtaining a suitable band pass frequency. Results show an improvement of (1-3 dB) in the signal to noise ratio (SNR) have been achieved, relative to the raw spatial filter output signals for all cases that were under investigation. Furthermore, the research鈥檚 goal included also estimation and reconstruction of the mean shape of the MUAP. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=EMG" title="EMG">EMG</a>, <a href="https://publications.waset.org/abstracts/search?q=Motor%20Unit" title=" Motor Unit"> Motor Unit</a>, <a href="https://publications.waset.org/abstracts/search?q=Digital%20Filter" title=" Digital Filter"> Digital Filter</a>, <a href="https://publications.waset.org/abstracts/search?q=Denoising" title=" Denoising"> Denoising</a> </p> <a href="https://publications.waset.org/abstracts/63012/denoising-of-motor-unit-action-potential-based-on-tunable-band-pass-filter" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/63012.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">401</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3773</span> A Compact Via-less Ultra-Wideband Microstrip Filter by Utilizing Open-Circuit Quarter Wavelength Stubs</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Muhammad%20Yasir%20Wadood">Muhammad Yasir Wadood</a>, <a href="https://publications.waset.org/abstracts/search?q=Fatemeh%20Babaeian"> Fatemeh Babaeian</a> </p> <p class="card-text"><strong>Abstract:</strong></p> By developing ultra-wideband (UWB) systems, there is a high demand for UWB filters with low insertion loss, wide bandwidth, and having a planar structure which is compatible with other components of the UWB system. A microstrip interdigital filter is a great option for designing UWB filters. However, the presence of via holes in this structure creates difficulties in the fabrication procedure of the filter. Especially in the higher frequency band, any misalignment of the drilled via hole with the Microstrip stubs causes large errors in the measurement results compared to the desired results. Moreover, in this case (high-frequency designs), the line width of the stubs are very narrow, so highly precise small via holes are required to be implemented, which increases the cost of fabrication significantly. Also, in this case, there is a risk of having fabrication errors. To combat this issue, in this paper, a via-less UWB microstrip filter is proposed which is designed based on a modification of a conventional inter-digital bandpass filter. The novel approaches in this filter design are 1) replacement of each via hole with a quarter-wavelength open circuit stub to avoid the complexity of manufacturing, 2) using a bend structure to reduce the unwanted coupling effects and 3) minimising the size. Using the proposed structure, a UWB filter operating in the frequency band of 3.9-6.6 GHz (1-dB bandwidth) is designed and fabricated. The promising results of the simulation and measurement are presented in this paper. The selected substrate for these designs was Rogers RO4003 with a thickness of 20 mils. This is a common substrate in most of the industrial projects. The compact size of the proposed filter is highly beneficial for applications which require a very miniature size of hardware. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=band-pass%20filters" title="band-pass filters">band-pass filters</a>, <a href="https://publications.waset.org/abstracts/search?q=inter-digital%20filter" title=" inter-digital filter"> inter-digital filter</a>, <a href="https://publications.waset.org/abstracts/search?q=microstrip" title=" microstrip"> microstrip</a>, <a href="https://publications.waset.org/abstracts/search?q=via-less" title=" via-less"> via-less</a> </p> <a href="https://publications.waset.org/abstracts/102110/a-compact-via-less-ultra-wideband-microstrip-filter-by-utilizing-open-circuit-quarter-wavelength-stubs" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/102110.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">156</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3772</span> Digital Watermarking Based on Visual Cryptography and Histogram</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=R.%20Rama%20Kishore">R. Rama Kishore</a>, <a href="https://publications.waset.org/abstracts/search?q=Sunesh"> Sunesh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Nowadays, robust and secure watermarking algorithm and its optimization have been need of the hour. A watermarking algorithm is presented to achieve the copy right protection of the owner based on visual cryptography, histogram shape property and entropy. In this, both host image and watermark are preprocessed. Host image is preprocessed by using Butterworth filter, and watermark is with visual cryptography. Applying visual cryptography on water mark generates two shares. One share is used for embedding the watermark, and the other one is used for solving any dispute with the aid of trusted authority. Usage of histogram shape makes the process more robust against geometric and signal processing attacks. The combination of visual cryptography, Butterworth filter, histogram, and entropy can make the algorithm more robust, imperceptible, and copy right protection of the owner. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=digital%20watermarking" title="digital watermarking">digital watermarking</a>, <a href="https://publications.waset.org/abstracts/search?q=visual%20cryptography" title=" visual cryptography"> visual cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=histogram" title=" histogram"> histogram</a>, <a href="https://publications.waset.org/abstracts/search?q=butter%20worth%20filter" title=" butter worth filter"> butter worth filter</a> </p> <a href="https://publications.waset.org/abstracts/48320/digital-watermarking-based-on-visual-cryptography-and-histogram" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/48320.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">358</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3771</span> Subjective Evaluation of Mathematical Morphology Edge Detection on Computed Tomography (CT) Images</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Emhimed%20Saffor">Emhimed Saffor</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, the problem of edge detection in digital images is considered. Three methods of edge detection based on mathematical morphology algorithm were applied on two sets (Brain and Chest) CT images. 3x3 filter for first method, 5x5 filter for second method and 7x7 filter for third method under MATLAB programming environment. The results of the above-mentioned methods are subjectively evaluated. The results show these methods are more efficient and satiable for medical images, and they can be used for different other applications. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=CT%20images" title="CT images">CT images</a>, <a href="https://publications.waset.org/abstracts/search?q=Matlab" title=" Matlab"> Matlab</a>, <a href="https://publications.waset.org/abstracts/search?q=medical%20images" title=" medical images"> medical images</a>, <a href="https://publications.waset.org/abstracts/search?q=edge%20detection" title=" edge detection "> edge detection </a> </p> <a href="https://publications.waset.org/abstracts/44926/subjective-evaluation-of-mathematical-morphology-edge-detection-on-computed-tomography-ct-images" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/44926.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">337</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3770</span> A Proposed Mechanism for Skewing Symmetric Distributions</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20T.%20Alodat">M. T. Alodat</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we propose a mechanism for skewing any symmetric distribution. The new distribution is called the deflation-inflation distribution (DID). We discuss some statistical properties of the DID such moments, stochastic representation, log-concavity. Also we fit the distribution to real data and we compare it to normal distribution and Azzlaini's skew normal distribution. Numerical results show that the DID fits the the tree ring data better than the other two distributions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=normal%20distribution" title="normal distribution">normal distribution</a>, <a href="https://publications.waset.org/abstracts/search?q=moments" title=" moments"> moments</a>, <a href="https://publications.waset.org/abstracts/search?q=Fisher%20information" title=" Fisher information"> Fisher information</a>, <a href="https://publications.waset.org/abstracts/search?q=symmetric%20distributions" title=" symmetric distributions"> symmetric distributions</a> </p> <a href="https://publications.waset.org/abstracts/28593/a-proposed-mechanism-for-skewing-symmetric-distributions" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/28593.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">658</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3769</span> Very Large Scale Integration Architecture of Finite Impulse Response Filter Implementation Using Retiming Technique</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=S.%20Jalaja">S. Jalaja</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20M.%20Vijaya%20Prakash"> A. M. Vijaya Prakash </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Recursive combination of an algorithm based on Karatsuba multiplication is exploited to design a generalized transpose and parallel Finite Impulse Response (FIR) Filter. Mid-range Karatsuba multiplication and Carry Save adder based on Karatsuba multiplication reduce time complexity for higher order multiplication implemented up to n-bit. As a result, we design modified N-tap Transpose and Parallel Symmetric FIR Filter Structure using Karatsuba algorithm. The mathematical formulation of the FFA Filter is derived. The proposed architecture involves significantly less area delay product (APD) then the existing block implementation. By adopting retiming technique, hardware cost is reduced further. The filter architecture is designed by using 90 nm technology library and is implemented by using cadence EDA Tool. The synthesized result shows better performance for different word length and block size. The design achieves switching activity reduction and low power consumption by applying with and without retiming for different combination of the circuit. The proposed structure achieves more than a half of the power reduction by adopting with and without retiming techniques compared to the earlier design structure. As a proof of the concept for block size 16 and filter length 64 for CKA method, it achieves a 51% as well as 70% less power by applying retiming technique, and for CSA method it achieves a 57% as well as 77% less power by applying retiming technique compared to the previously proposed design. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=carry%20save%20adder%20Karatsuba%20multiplication" title="carry save adder Karatsuba multiplication">carry save adder Karatsuba multiplication</a>, <a href="https://publications.waset.org/abstracts/search?q=mid%20range%20Karatsuba%20multiplication" title=" mid range Karatsuba multiplication"> mid range Karatsuba multiplication</a>, <a href="https://publications.waset.org/abstracts/search?q=modified%20FFA%20and%20transposed%20filter" title=" modified FFA and transposed filter"> modified FFA and transposed filter</a>, <a href="https://publications.waset.org/abstracts/search?q=retiming" title=" retiming"> retiming</a> </p> <a href="https://publications.waset.org/abstracts/56239/very-large-scale-integration-architecture-of-finite-impulse-response-filter-implementation-using-retiming-technique" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/56239.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">235</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3768</span> A Finite Memory Residual Generation Filter for Fault Detection</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Pyung%20Soo%20Kim">Pyung Soo Kim</a>, <a href="https://publications.waset.org/abstracts/search?q=Eung%20Hyuk%20Lee"> Eung Hyuk Lee</a>, <a href="https://publications.waset.org/abstracts/search?q=Mun%20Suck%20Jang"> Mun Suck Jang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the current paper, a residual generation filter with finite memory structure is proposed for fault detection. The proposed finite memory residual generation filter provides the residual by real-time filtering of fault vector using only the most recent finite observations and inputs on the window. It is shown that the residual given by the proposed residual generation filter provides the exact fault for noise-free systems. Finally, to illustrate the capability of the proposed residual generation filter, numerical examples are performed for the discretized DC motor system having the multiple sensor faults. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=residual%20generation%20filter" title="residual generation filter">residual generation filter</a>, <a href="https://publications.waset.org/abstracts/search?q=finite%20memory%20structure" title=" finite memory structure"> finite memory structure</a>, <a href="https://publications.waset.org/abstracts/search?q=kalman%20filter" title=" kalman filter"> kalman filter</a>, <a href="https://publications.waset.org/abstracts/search?q=fast%20detection" title=" fast detection"> fast detection</a> </p> <a href="https://publications.waset.org/abstracts/35140/a-finite-memory-residual-generation-filter-for-fault-detection" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/35140.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">698</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/abstracts/search?q=symmetric%20half-plane%20digital%20filter&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=symmetric%20half-plane%20digital%20filter&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=symmetric%20half-plane%20digital%20filter&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=symmetric%20half-plane%20digital%20filter&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=symmetric%20half-plane%20digital%20filter&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=symmetric%20half-plane%20digital%20filter&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=symmetric%20half-plane%20digital%20filter&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=symmetric%20half-plane%20digital%20filter&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=symmetric%20half-plane%20digital%20filter&page=10">10</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=symmetric%20half-plane%20digital%20filter&page=126">126</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=symmetric%20half-plane%20digital%20filter&page=127">127</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=symmetric%20half-plane%20digital%20filter&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>