• 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 applied mathematics & informatics
• /
• v.4 no.2
• /
• pp.535-543
• /
• 1997

The application of Hadamard matrix to the paral-lel routings on the hypercube network was presented by Rabin. In this matrix every two rows differ from each other by exactly n/2 positions. A set of n disjoint paths on n-dimensional hypercube net-work was designed using this peculiar property of Hadamard ma-trix. Then the data is dispersed into n packets and these n packet are transmitted along these n disjoint paths. In this paper Rabin's routing algorithm is analyzed in terms of covering problem and as-signment problem. Finally we conclude that n packets dispersed are placed in well-distributed positions during transmisson and the ran-domly selected paths are almost a set of n edge-disjoint paths with high probability.

• East Asian mathematical journal
• /
• v.36 no.1
• /
• pp.61-71
• /
• 2020

Up to the present day, the best solution we can get to the truncated moment problem (TMP) is probably the Flat Extension Theorem. It says that if the corresponding moment matrix of a moment sequence admits a rank-preserving positive extension, then the sequence has a representing measure. However, constructing a flat extension for most higher-order moment sequences cannot be executed easily because it requires to allow many parameters. Recently, the author has considered various decompositions of a moment matrix to find a solution to TMP instead of an extension. Using a new approach with the Hadamard product, the author would like to introduce more techniques related to moment matrix decompositions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.10A
• /
• pp.1560-1565
• /
• 2000

Over an additive abelian group G of order g and for a given positive integer λ, a generalized Hadamard matrix GF(g,λ) is defined as a gλ$\times$gλ matrix [h(i,j)] where 1$\leq$i$\leq$gλ,1$\leq$j$\leq$gλ, such that every element of G appears exactly λ times in the list h(i$_1$,1)-h(i$_2$,1), h(i$_1$,2)-h(i$_2$,2),...,h(i$_1$,gλ)-h(i$_2$, gλ) for any i$\neq$j. In this paper, we propose a new method of expanding a GH(\ulcorner,λ$_1$) = B = \ulcorner over G by replacing each of its m-tuple \ulcorner with \ulcorner GH(g,λ$_2$) where m=gλ$_2$. We may use \ulcornerλ$_1$(not necessarily all distinct) GH(g,λ$_2$)'s for the substitution and the resulting matrix is defined over the group of order g.

• Current Optics and Photonics
• /
• v.5 no.6
• /
• pp.686-698
• /
• 2021

A camouflaged encryption scheme based on Hadamard matrix and ghost imaging is proposed. In the process of the encryption, an orthogonal matrix is used as the projection pattern of ghost imaging to improve the definition of the reconstructed images. The ciphertext of the secret image is constrained to the camouflaged image. The key of the camouflaged image is obtained by the method of sparse decomposition by principal component orthogonal basis and the constrained ciphertext. The information of the secret image is hidden into the information of the camouflaged image which can improve the security of the system. In the decryption process, the authorized user needs to extract the key of the secret image according to the obtained random sequences. The real encrypted information can be obtained. Otherwise, the obtained image is the camouflaged image. In order to verify the feasibility, security and robustness of the encryption system, binary images and gray-scale images are selected for simulation and experiment. The results show that the proposed encryption system simplifies the calculation process, and also improves the definition of the reconstructed images and the security of the encryption system.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.9
• /
• pp.30-40
• /
• 2014

As the Hadamard transform can be generalized into the Jacket transform, in this paper, we generalize the Haar transform into the Jacket-Haar transform. The entries of the Jacket-Haar transform are 0 and ${\pm}2^k$. Compared with the original Haar transform, the basis of the Jacket-Haar transform is general and more suitable for signal processing. As an application, we present the DCT-II(discrete cosine transform-II) based on $2{\times}2$ Hadamard matrix and HWT(Haar Wavelete transform) based on $2{\times}2$ Haar matrix, analysis the performances of them and estimate them via the Lenna image simulation.

• Journal of applied mathematics & informatics
• /
• v.13 no.1_2
• /
• pp.117-123
• /
• 2003

For an n ${\times}$ n real matrix X, let ${\Phi}$(X) = X o (X$\^$-1/)$\^$T/, where o stands for the Hadamard (entrywise) product. Suppose A, B, G and D are n ${\times}$ n real nonsingular matrices, and among them there are at least one solutions to the equation (equation omitted). An equivalent condition which enable (equation omitted) become a real solution ot the equation (equation omitted), is given. As application, we get new real solutions to the matrix equation (equation omitted) by applying the results of Zhang. Yang and Cao [SIAM.J.Matrix Anal.Appl, 21(1999), pp: 642-645] and Chen [SIAM.J.Matrix Anal.Appl, 22(2001), pp:965-970]. At the same time, all solutions of the matrix equation (equation omitted) are also given.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.5
• /
• pp.571-579
• /
• 1999

In this paper, a Hadamard transform imaging spectrometer(HTIS) is proposed by using a grill spectrometer. And we reconfigure the system by using the grill sectrometer which uses a left cyclic S-matrix instead of the conventional right cyclic one. Then, we model the Hadamard transform imaging spectrometer and apply the mask characteristics compensation method, i.e. $ {T}^{-1}$ method, to complete fast algorithm. Also, through computer simulations the superiority of the proposed system in this paper to the conventional Hadamard transform spectrometer(HTS) is proved and the performance of the two systems are compared by introducing average mean square error(AMSE) as the algebraic criterion.

• 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 the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.6
• /
• pp.319-327
• /
• 2016

In this paper we investigate that most of plants and animals have the symmetric property, such as a tree or a sheep's horn. In addition, the human body is also symmetric and contains the DNA. We can see the logarithm helices in Fibonacci series and animals, and helices of plants. The sunflower has a shape of circle. A circle is circular symmetric because the shapes are same when it is shifted on the center. Einstein's spatial relativity is the relation of time and space conversion by the symmetrically generalization of time and space conversion over the spacial. The left and right helices of plants and animals are the symmetric and have element-wise inverse relationships each other. The weight of center weight Hadamard matrix is 2 and is same as the base 2 of natural logarithm. The helix matrices are symmetric and have element-wise inverses.