• Title/Summary/Keyword: S-transform

Search Result 2,316, Processing Time 0.027 seconds

Large Solvent and Noise Peak Suppression by Combined SVD-Harr Wavelet Transform

  • Kim, Dae-Sung;Kim, Dai-Gyoung;Lee, Yong-Woo;Won, Ho-Shik
    • Bulletin of the Korean Chemical Society
    • /
    • v.24 no.7
    • /
    • pp.971-974
    • /
    • 2003
  • By utilizing singular value decomposition (SVD) and shift averaged Harr wavelet transform (WT) with a set of Daubechies wavelet coefficients (1/2, -1/2), a method that can simultaneously eliminate an unwanted large solvent peak and noise peaks from NMR data has been developed. Noise elimination was accomplished by shift-averaging the time domain NMR data after a large solvent peak was suppressed by SVD. The algorithms took advantage of the WT, giving excellent results for the noise elimination in the Gaussian type NMR spectral lines of NMR data pretreated with SVD, providing superb results in the adjustment of phase and magnitude of the spectrum. SVD and shift averaged Haar wavelet methods were quantitatively evaluated in terms of threshold values and signal to noise (S/N) ratio values.

Modified Constrained Notch Fourier Transform (MCNFT) for Sinusoidal Signals in Noise and Its Performance

  • Xiao, Yegui
    • Proceedings of the IEEK Conference
    • /
    • 2000.07b
    • /
    • pp.673-676
    • /
    • 2000
  • Adaptive Fourier analysis of sinusoidal signals in noise is of essential importance in many engineering fields. So far, many adaptive algorithms have been developed for this purpose. In particular, a filter bank based algorithm called constrained notch Fourier transform of its cost-efficiency and easily controllable performance. However, its performance deteriorates when the signal frequencies are not uniformly spaced. This paper proposes, at first, a new structure for the CNFT, referred to as modified CNFT (MCNFT), to compensate the performance degeneration of the CNFT for noisy sinusoidal signals with non-uniformly spaced frequencies. Next, a detailed performance analysis for the MCNFT is conducted. Closed form expression of steady-state mean square error (MSE) for the discrete Fourier coefficients (DFCs) is derived. Extensive simulations are presented to demonstrate the improved performance of the MCNFT and the validity of the analytical results.

  • PDF

A Performance Analysis of OFDM Systems in Excessively Dispersive Multipath Channels

  • Lee Woo-Kwon;Curry Christopher S.
    • Journal of Communications and Networks
    • /
    • v.8 no.3
    • /
    • pp.323-329
    • /
    • 2006
  • For orthogonal frequency division multiplexing (OFDM), the discrete Fourier transform (DFT)-based processing at the receiver has been perceived equivalent to the matched filter (MF)-based processing. In this paper, we revisit the equivalence and mathematically show that when the guard interval is insufficient, the well-known DFT-based processing inherently causes more intersymbol and interchannel interference (ISI/ICI) than the MF-based processing. Then, with the adverse increase of interference, analytical expressions for the link performance are derived in terms of bit error rate (BER). Numerical results from computer simulation and analysis are presented to justify our claims.

Analysis and Optimal Control of Linear Time-delay Systems via Fast Walsh Transform (고속윌쉬변환에 의한 선형시지연계의 해석 및 최적제어)

  • Han, Sang-In;Lee, Myeong-Gyu;Kim, Jin-Tae;An, Du-Su
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.48 no.5
    • /
    • pp.601-606
    • /
    • 1999
  • A Walsh function method is proposed in this report for the analysis and optimal control of linear time-delay systems, which is based on the Picard's iterative approximation and fast Walsh transformation. In this research, the following results are obtained: 1) The differential and integral equation can be solved by transforming into a simple algebraic equation as it was possible with the usual orthogonal function method: 2) General orthogonal function methods require usage of Walsh operational matrices for delay or advance and many calculations of inverse matrices, which are not necessary in this method. Thus, the control problems of linear time-delay systems can be solved much faster and readily.

  • PDF

Two collinear Mode-I cracks in piezoelectric/piezomagnetic materials

  • Zhou, Zhen-Gong;Wang, Jia-Zhi;Wu, Lin-Zhi
    • Structural Engineering and Mechanics
    • /
    • v.29 no.1
    • /
    • pp.55-75
    • /
    • 2008
  • In this paper, the behavior of two collinear Mode-I cracks in piezoelectric/piezomagnetic materials subjected to a uniform tension loading was investigated by the generalized Almansi's theorem. Through the Fourier transform, the problem can be solved with the help of two pairs of triple integral equations, in which the unknown variables were the jumps of displacements across the crack surfaces. To solve the triple integral equations, the jumps of displacements across the crack surfaces were directly expanded as a series of Jacobi polynomials to obtain the relations among the electric displacement intensity factors, the magnetic flux intensity factors and the stress intensity factors at the crack tips. The interaction of two collinear cracks was also discussed in the present paper.

Adaptive Optimal Control of Nonlinear Systems via Fast Walsh Transform (고속월쉬변환에 의한 비선형계의 적응형 최적제어)

  • Yoo, Young-Sik;Lim, Yun-Sik
    • Proceedings of the KIEE Conference
    • /
    • 2008.11b
    • /
    • pp.65-68
    • /
    • 2008
  • This paper presents the new adaptive optimal scheme for the nonlinear systems, which is based on the Picard's iterative approximation and Fast Walsh transform. It is well known that the Walsh function approach method is very difficult to apply for the analysis and optimal control of nonlinear systems. However, these problems can be easily solved by the improvement of the previous adaptive optimal scheme. The proposed method is easily applicable to the analysis and optimal control of nonlinear systems.

  • PDF

Cell Counting Algorithm Using Radius Variation, Watershed and Distance Transform

  • Kim, Taehoon;Kim, Donggeun;Lee, Sangjoon
    • Journal of Information Processing Systems
    • /
    • v.16 no.1
    • /
    • pp.113-119
    • /
    • 2020
  • This study proposed the structure of the cluster's cell counting algorithm for cell analysis. The image required for cell count is taken under a microscope. At present, the cell counting algorithm is reported to have a problem of low accuracy of results due to uneven shape and size clusters. To solve these problems, the proposed algorithm has a feature of calculating the number of cells in a cluster by applying a radius change analysis to the existing distance conversion and watershed algorithm. Later, cell counting algorithms are expected to yield reliable results if applied to the required field.

ECG Data Compression Using Wavelet Transform and Adaptive Fractal Interpolation (웨이브렛 변환과 적응 프랙탈 보간을 이용한 심전도 데이터 압축)

  • Lee, W.H.;Yoon, Y.R.;Park, S.J.
    • Proceedings of the KOSOMBE Conference
    • /
    • v.1996 no.11
    • /
    • pp.221-224
    • /
    • 1996
  • This paper presents the ECG data compression using wavelet transform(WT) and adaptive fractal interpolation(AFI). The WT has the subband coding scheme. The fractal compression method represents any range of ECG signal by fractal interpolation parameters. Specially, the AFI used the adaptive range sizes and got good performance for ECG data compression. In this algorithm, the AFI is applied into the low frequency part of WT. The MIT/BIH arrhythmia data was used for evaluation. The compression rate using WT and AFI algorithm is better than the compression rate using AFI. The WT and AFI algorithm yields compression ratio as high as 21.0 without any entroy coding.

  • PDF

Lossy Image Compression Based on Quad Tree Algorithm and Geometrical Wavelets (사분트리 알고리즘과 기하학적 웨이블렛을 이용한 손실 영상 압축)

  • Chu, Hyung-Suk;An, Chong-Koo
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.58 no.11
    • /
    • pp.2292-2298
    • /
    • 2009
  • In this paper, the lossy image compression algorithm using the quad tree and the bandlets is proposed. The proposed algorithm transforms input images by the discrete wavelet transform (DWT) and represents the geometrical structures of high frequency bands using the bandlets with a 8 block- size. In addition, the proposed algorithm searches the position information of the significant coefficients by using the quad tree algorithm and computes the magnitude and the sign information of the significant coefficients by using the Embedded Image Coding using Zerotrees of Wavelet Coefficients (EZW) algorithm. The compression result by using the quad tree algorithm improves the PSNR performance of high frequency images up to 1 dB, compared to that of JPEG-2000 algorithm and that of S+P algorithm. The PSNR performance by using DWT and bandlets improves up to 7.5dB, compared to that by using only DWT.

A Study on Analysis of Distributed Parameter Systems via Fast Walsh Transform (고속 월쉬 변환을 이용한 분포정수계의 해석에 관한 연구)

  • Kim, Tai-Hoon;Kim, Jin-Tae;Chae, Young-Moo;Lee, Hae-Gi;Kim, Jong-Boo;Ahn, Doo-Soo
    • Proceedings of the KIEE Conference
    • /
    • 2001.07d
    • /
    • pp.2084-2086
    • /
    • 2001
  • This study uses distributed parameter systems as the spatial discretization technique, modelling in lumped parameter systems, and applies orthogonal transform and the Picard's iteration method to high order partial differential equations and matrix partial differential equations. In exercising optimal control of distributed parameter systems, excellent consequences are found without using the existing decentralized control or hierarchical control method.

  • PDF