• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.1379-1382
• /
• 1997

We introduce a fast implementation of the adaptive transversal filter which uses least-mean-square(LMS) algorithm. The fast Hadamard transform(FHT) is used for the implementation of the filter. By using the proposed filter we can get the significant time reduction in computatioin over the conventional time domain LMS filter at the cost of a little performance. By computer simulation, we show the comparison of the propsed Hadamard-domain filter and the time domain filter in the view of multiplication time, mean-square error and robustness for noise.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.242-242
• /
• 2000

Comparing to the conventional adaptive filters using LMS algorithm, the proposed adaptive filters can reduce the amounts of computation and have robustness to variance of characteristics of input signals. LMS algorithm is performed in the domain of Hadamard transform after a reference signal and input signal are transformed by fast Hadamard transformation. As a transformation from time domain to Hadamard transformed domain, the proposed filter not only maintains the performance of estimating an input signal but also greatly reduces the number of multiplication. Moreover, the effect of characteristic changes of input signal is decreased. Computer simulation shows the stability and robustness of the proposed filter.

• Proceedings of the KIEE Conference
• /
• 1999.07b
• /
• pp.1017-1019
• /
• 1999

In this paper we present 2-dimensional image recovery method using Hadamard transform. Generally, the methods of Hadamard transform are more useful tools and much simplier than those of Fourier transform. The Hadamard transform can improve estimates when the detector is the source of noise. We take into account nonidealities in the system for the further improved image We also present the average mean square error(AMSE) associated with estimates with the results from computer simulations.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.4-7
• /
• 1997

When we use Hadamard transform spectrometers (HTS), we can increase signal to noise ratio(SNR) by multiplexing which is done by masks. But if the mask has a single defective element, output-SNR decreases. In this paper the effect of a single defective element on the output-SNR is investigated. And a method of compensating for the defective mask element is presented.

• Journal of the Korean Professional Engineers Association
• /
• v.16 no.4
• /
• pp.15-19
• /
• 1983

Therefore the use of Hadamard transform in the image processing requires only the real number operations and results in the computational advantages. Recently, however, certain degradation aspects have been reported. In this paper we propose a WH matrixtwhich retains the main properties of Hadamard matrix. The actual improvement of the image transmission in the inner part of the picture has been demonstrated by the computer simulated image developments. The orthogonal transforms such as Hadamard transform offers a useful facility in the digital signal processing. As the size of the transmission block increases, however, the assignment of bits for each data must increase exponentially. Thus the SNR of the image tends to decline accordingly. As an attempt to increase the SNR, we propose the WH matrix whose elements are made of ${\pm}$1, ${\pm}$2, ${\pm}$3, ${\pm}$4, and the unitform is 8${\times}$8 matrix.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.1
• /
• pp.173-176
• /
• 1987

This paper presents a simple factorization of the Hadamard matrix which is used to develop a fast algorithm for the Hadamard transform. This matrix decomposition is of the kronecker products of identity matrices and successively lower order Hadamard matrices. This following shows how the Kronecker product can be mathematically defined and efficiently implemented using a factorization matrix methods.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.12
• /
• pp.1527-1536
• /
• 1999

In this paper, a triply-encoded Hadamard transform imaging spectrometer is proposed by applying the grill spectrometer to the Hadamard transform imaging spectrometer. The proposed system encodes the input radiation triply ; once through the input image mask and twice through the two masks in the grill spectrometer. We use an electro-optical mask in the grill spectrometer which is controlled by a left-cyclic simplex matrix. Then we modeled the system using $D^{-1}$ method. In this paper, the average mean square error associated with a recovered estimate is considered for performance evaluation. The relative performance is compared with those of the other conventional systems.

• Journal of the Korean Mathematical Society
• /
• v.39 no.5
• /
• pp.709-729
• /
• 2002

Using the well known Hermite-Hadamard integral inequality for convex functions, some inequalities for the finite Hilbert transform of functions whose first derivatives are convex are established. Some numerical experiments are performed as well.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.769-772
• /
• 2001

Waish-Hadamard Transform은 압축, 필터링, 코드 디자인 등 다양한 이미지처리 분야에 응용되어왔다. 이러한 Hadamard Transform을 기본으로 확장한 Jacket Transform은 행렬의 원소에 가중치를 부여함으로써 Weighted Hadamard Matrix라고 한다. Jacket Matrix의 cocyclic한 특성은 암호화, 정보이론, TCM 등 더욱 다양한 응용분야를 가질 수 있고, Space Time Code에서 대역효율, 전력면에서도 효율적인 특성을 나타낸다 [6],[7]. 본 논문에서는 Distributed Arithmetic(DA) 구조를 이용하여 Fast Jacket Transform(FJT)을 구현한다. Distributed Arithmetic은 ROM과 어큐뮬레이터를 이용하고, Jacket Watrix의 행렬을 분할하고 간략화하여 구현함으로써 하드웨어의 복잡도를 줄이고 기존의 시스톨릭한 구조보다 면적의 이득을 얻을 수 있다. 이 방법은 수학적으로 간단할 뿐 만 아니라 행렬의 곱의 형태를 단지 덧셈과 뺄셈의 형태로 나타냄으로써 하드웨어로 쉽게 구현할 수 있다. 이 구조는 입력데이타의 워드길이가 n일 때, O(2n)의 계산 복잡도를 가지므로 기존의 시스톨릭한 구조와 비교하여 더 적은 면적을 필요로 하고 FPGA로의 구현에도 적절하다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.10 no.2
• /
• pp.93-103
• /
• 1985

The digital signal processing technique by bandwidth compression has been grown up ragidly owing to integrated circuit developments. In this project, we have proposed the Lee Weighted Hadamard (LWH) transform which retains the main properties of Hadamard matirx. The LWH matrix was weighted in the center of the spatial domain. The human visual of the mid spatial are emphasized more than the low and high spatial frequencies. The fast algorithms of the LWH transform has been studied for hardware realization. The result of this project are availabel to airplane photograph, X-Ray, CATV and the artificial satellite of the digital image processing.