• Title/Summary/Keyword: odd-even scheme

Search Result 20, Processing Time 0.02 seconds

Denoising Based on the Adaptive Lifting

  • Lee, Chang-Soo;Yoo, Kyung-Yul
    • The Journal of the Acoustical Society of Korea
    • /
    • v.18 no.1E
    • /
    • pp.13-19
    • /
    • 1999
  • This paper introduces an adaptive wavelet transform based on the lifting scheme, which is applied to signal denoising. The wavelet representation using orthogonal wavelet bases has received widespread attention. Recently the lifting scheme has been developed for the construction of biorthogonal wavelets in the spatial domain. Wavelet transforms are performed through three stages: the first stage or Lazy wavelet splits the data into two subsets, even and odd, the second stage calculates the wavelet coefficients (highpass) as the failure to interpolate or predict the odd set using the even, and the third stage updates the even set using neighboring odd points (wavelet coefficients) to compute the scaling function coefficients (lowpass). In this paper, we adaptively find some of the prediction coefficients for better representation of signals and this customizes wavelet transforms to provide an efficient framework for denoising. Special care has been given to the boundaries, where we design a set of different prediction coefficients to reduce the prediction error.

  • PDF

Two-Dimensional Adaptive Mesh Generation Algorithm and its Application with Higher-Order Compressible Flow Solver

  • Phongthanapanich, Sutthisak;Dechaumphai, Pramote
    • Journal of Mechanical Science and Technology
    • /
    • v.18 no.12
    • /
    • pp.2190-2203
    • /
    • 2004
  • A combined procedure for two-dimensional Delaunay mesh generation algorithm and an adaptive remeshing technique with higher-order compressible flow solver is presented. A pseudo-code procedure is described for the adaptive remeshing technique. The flux-difference splitting scheme with a modified multidimensional dissipation for high-speed compressible flow analysis on unstructured meshes is proposed. The scheme eliminates nonphysical flow solutions such as the spurious bump of the carbuncle phenomenon observed from the bow shock of the flow over a blunt body and the oscillation in the odd-even grid perturbation in a straight duct for the Quirk's odd-even decoupling test. The proposed scheme is further extended to achieve higher-order spatial and temporal solution accuracy. The performance of the combined procedure is evaluated on unstructured triangular meshes by solving several steady-state and transient high-speed compressible flow problems.

CONSTRUCTION OF A SYMMETRIC SUBDIVISION SCHEME REPRODUCING POLYNOMIALS

  • Ko, Kwan Pyo
    • Communications of the Korean Mathematical Society
    • /
    • v.31 no.2
    • /
    • pp.395-414
    • /
    • 2016
  • In this work, we study on subdivision schemes reproducing polynomials and build a symmetric subdivision scheme reproducing polynomials of a certain predetermined degree, which is a slight variant of the family of Deslauries-Dubic interpolatory ones. Related to polynomial reproduction, a necessary and sufficient condition for a subdivision scheme to reproduce polynomials of degree L was recently established under the assumption of non-singularity of subdivision schemes. In case of stepwise polynomial reproduction, we give a characterization for a subdivision scheme to reproduce stepwise all polynomials of degree ${\leq}L$ without the assumption of non-singularity. This characterization shows that we can investigate the polynomial reproduction property only by checking the odd and even masks of the subdivision scheme. The minimal-support condition being relaxed, we present explicitly a general formula for the mask of (2n + 4)-point symmetric subdivision scheme with two parameters that reproduces all polynomials of degree ${\leq}2n+1$. The uniqueness of such a symmetric subdivision scheme is proved, provided the two parameters are given arbitrarily. By varying the values of the parameters, this scheme is shown to become various other well known subdivision schemes, ranging from interpolatory to approximating.

Comparisons of Practical Performance for Constructing Compressed Suffix Arrays (압축된 써픽스 배열 구축의 실제적인 성능 비교)

  • Park, Chi-Seong;Kim, Min-Hwan;Lee, Suk-Hwan;Kwon, Ki-Ryong;Kim, Dong-Kyue
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.34 no.5_6
    • /
    • pp.169-175
    • /
    • 2007
  • Suffix arrays, fundamental full-text index data structures, can be efficiently used where patterns are queried many times. Although many useful full-text index data structures have been proposed, their O(nlogn)-bit space consumption motivates researchers to develop more space-efficient ones. However, their space efficient versions such as the compressed suffix array and the FM-index have been developed; those can not reduce the practical working space because their constructions are based on the existing suffix array. Recently, two direct construction algorithms of compressed suffix arrays from the text without constructing the suffix array have been proposed. In this paper, we compare practical performance of these algorithms of compressed suffix arrays with that of various algorithms of suffix arrays by measuring the construction times, the peak memory usages during construction and the sizes of their final outputs.

A Traffic Adaptive MAC Scheduling for Bluetooth with Maximized throughput and Guaranteed fairness

  • Kim Tae suk;Choi Sung-Gi;Kim Sehun
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2002.05a
    • /
    • pp.418-425
    • /
    • 2002
  • Bluetooth is an emerging technology expected to provide users with short range, low cost, pico-cellular wireless connectivity. The access to the medium for Bluetooth is based on a Master driven Time Division Duplexing (TDD) scheme. A slave transmits packets in the reverse slot only after the master polls the slave (or transmits a packet to the slave) in a forward slot. The master transmits packets to a slave in even slots while the slave transmits packets to the master in an odd slot. The way in which the master schedules packets transmission to slaves or polls them determines system performance. In this paper. we propose a traffic adaptive MAC scheduling scheme for Bluetooth. The proposed scheme adopts the ISAR (Intelligent Segmentation and Reassembly) policy, which adjusts the packet size to the traffic patterns, to adapt the polling frequency to the traffic conditions. Also for achieving fairness among master-slave connections our scheme includes a priority policy assinging prioritised service tlimes to each connection. By considering a scenario where a Bluetooth master is used as wireless access point to the Internet, we show that our scheme improve the system throughput and average queue delay with regard to a naive Round Robin (RR) scheme.

  • PDF

Blind adaptive receiver for uplink multiuser massive MIMO systems

  • Shin, Joonwoo;Seo, Bangwon
    • ETRI Journal
    • /
    • v.42 no.1
    • /
    • pp.26-35
    • /
    • 2020
  • Herein, we consider uplink multiuser massive multiple-input multiple-output systems when multiple users transmit information symbols to a base station (BS) by applying simple space-time block coding (STBC). At the BS receiver, two detection filters for each user are used to detect the STBC information symbols. One of these filters is for odd-indexed symbols and the other for even-indexed symbols. Using constrained output variance metric minimization, we first derive a special relation between the closed-form optimal solutions for the two detection filters. Then, using the derived special relation, we propose a new blind adaptive algorithm for implementing the minimum output variance-based optimal filters. In the proposed adaptive algorithm, filter weight vectors are updated only in the region satisfying the special relation. Through a theoretical analysis of the convergence speed and a computer simulation, we demonstrate that the proposed scheme exhibits faster convergence speed and lower steady-state bit error rate than the conventional scheme.

A Single-Phase Unified Power Quality Conditioner with a Frequency-Adaptive Repetitive Controller

  • Phan, Dang-Minh;Lee, Hong-Hee
    • Journal of Electrical Engineering and Technology
    • /
    • v.13 no.2
    • /
    • pp.790-799
    • /
    • 2018
  • This paper proposes a single-phase unified power quality conditioner (S-UPQC) for maintaining power quality issues in a microgrid. The S-UPQC can compensate the voltage and current harmonics, voltage sag, and swell as a dynamic voltage restorer (DVR), regardless of variations in the grid frequency. Odd harmonics are treated as even-order harmonics in a rotating frame to implement the harmonic compensators with only one repetitive controller (RC) without any harmonic extractor. The dynamic performance is improved and the delay time is reduced in the RC. The S-UPQC control scheme is designed to maintain accurate and stable operation under deviations of the grid frequency by using the Lagrange interpolation-based finite-impulse-response (LIFIR) filter approximation method. The proposed control schemes were validated through a simulation and experiment.

Incorporation of anisotropic scattering into the method of characteristics

  • Rahman, Anisur;Lee, Deokjung
    • Nuclear Engineering and Technology
    • /
    • v.54 no.9
    • /
    • pp.3478-3487
    • /
    • 2022
  • In this study, we incorporate an anisotropic scattering scheme involving spherical harmonics into the method of characteristics (MOC). The neutron transport solution in a light water reactor can be significantly improved because of the impact of an anisotropic scattering source with the MOC flat source approximation. Several problems are selected to verify the proposed scheme and investigate its effects and accuracy. The MOC anisotropic scattering source is based on the expansion of spherical harmonics with Legendre polynomial functions. The angular flux, scattering source, and cross section are expanded in terms of the surface spherical harmonics. Later, the polynomial is expanded to achieve the odd and even parity of the source components. Ultimately, the MOC angular and scalar fluxes are calculated from a combination of two sources. This paper presents various numerical examples that represent the hot and cold conditions of a reactor core with boron concentration, burnable absorbers, and control rod materials, with and without a reflector or baffle. Moreover, a small critical core problem is considered which involves significant neutron leakage at room temperature. We demonstrate that an anisotropic scattering source significantly improves solution accuracy for the small core high-leakage problem, as well as for practical large core analyses.

OFDM/OQAM-IOTA System With Odd/Even Center Preamble Structure (Odd/Even Center Preamble 구조를 가진 OFDM/OQAM-IOTA 시스템)

  • Kang, Seung-Won;Heo, Joo;Chang, Kyung-Hi
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.12A
    • /
    • pp.1153-1160
    • /
    • 2005
  • OFDM/OQAM(Offset QAM)-IOTA system requires the IOTA(Isotropic Orthogonal Transform Algorithm) function that has superior localization property in time and frequency domain instead of guard interval used for conventional OFDM/QAM system to be robust to multipath channel. Therefore, OFDM/OQAM-IOTA system has more spectral efficiency than conventional OFDM/QAM system. But, when channel estimation scheme for conventional OFDM/QAM system is applied straightforwardly to OFDM/OQAM-IOTA system, an intrinsic Inter- symbol-Interference is observed. So suitable preamble structure for the channel estimation scheme of OFDM/OQAM-IOTA system is required. In this paper, we propose a new preamble structure that is appropriate to OPDM/OQAM-IOTA system and then perform ideal channel estimation and practical channel estimation in low-to-medium mobile speed and compare them with conventional OFDM/QAM system. Simulation results show that OFDM/OQAM-IOTA system with proposed preamble structure has 1.5 dB Eb/NO gain on Target BER $10^{-3}$ and about $25\%$ transmission rate gain against the conventional OFDM/QAM system considering quarter of FFT size as guard interval size.

A study on RDM algorithm for document image and application to digital signature (문서화상에 대한 RDM 합성 알고리즘 및 디지틀 서명에의 응용)

  • 박일남;이대영
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.12
    • /
    • pp.3056-3068
    • /
    • 1996
  • This papre presents the RDM algorithm for composition of bit. After this, we propose a digital signature scheme for facsimile document using RDM algorithm. We modify the even-odd feature in distance of changing pel between coding line and multiple reference line which have been scanned before, and run-length in coding line. The time to take in signature is reduced by spreading of signature. Non-repudiation in origin, the 3rd condition of digital signature is realized by proposed digital signature scheme. The transmitter embeds the signature secretly and tensfers it, and the receiver makes a check of any forgery on the signature and the document. This scheme is compatible with the ITU-T.4(G3 or G4 facsimile standard). The total amount of data transmitted and the quality of image are about the same to that of the original document, thus a third party does not notics signature embeded on the document.

  • PDF