• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.2
• /
• pp.301-308
• /
• 1987

In this paper, we have defined the Weighted Hadamard Transform (WHT) and developed efficient algorithms for the fast computation of the WHT. The WHT is applied to digital image processing and compared with Hadamard Transform (HT). We have weighted at the center spatial frequency domains of the Hadamard Transform and transmitted a image and then center high frequencies are neglected at the receiving. The WHT of signal to noise ratio(SNR) and image quality are enhanced than the HT.

• Journal of electromagnetic engineering and science
• /
• v.7 no.1
• /
• pp.17-27
• /
• 2007

Jacket matrices which are defined to be $n{\times}n$ matrices $A=(a_{jk})$ over a field F with the property $AA^+=nI_n$ where $A^+$ is the transpose matrix of elements inverse of A,i.e., $A^+=(a_{kj}^-)$, was introduced by Lee in 1984 and are used for signal processing and coding theory, which generalized the Hadamard matrices and Center Weighted Hadamard matrices. In this paper, some properties and constructions of Jacket matrices are extensively investigated and small orders of Jacket matrices are characterized, also present the full rate and the 1/2 code rate complex orthogonal space time code with full diversity.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1984.10a
• /
• pp.74-77
• /
• 1984

In this paper, We have proposed the new lee weighted Hadamard transform which retains the main properties of Hadamard matrix. The non-orthogonal LWH matrix was Weighted in the center of the spatial domain. The human visual response to spatioal requencies in nonuniform and that the mid spatial frequencies are emphasized more than the low and high spatial frequencies, the faast algorithm of the Lee Weighted Hadamard transform has shown by the sparse matrix factorization.

• 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.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.1
• /
• pp.132-137
• /
• 2007

Jacket transforms are a class of transforms which are simple to calculate, easily inverted and are size-flexible. Previously reported jacket transforms were generalizations of the well-known Walsh-Hadamard transform (WHT) and the center-weighted Hadamard transform (CWHT). In this paper we present a new class of jacket transform not derived from either the WHT or the CWHT. This class of transform can be applied to any even length vector, and is applicable to finite fields and is useful for constructing error control codes.

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.11 no.3
• /
• pp.197-203
• /
• 1986

The images which are scanned by CCTV are converted to digital signal and 6502 Microcomputer processes data by Transform coding. Thus data is reduced to $64{ imes}64$pixels and input by outer memory using same address with inner one for the fast process. Hadmard Transform, Weighted Hadamard Transform which is weighted in the center of matrix and Haar Transform are programmed by assembly language and every Transform is dome within one second.

• Kyungpook Mathematical Journal
• /
• v.64 no.1
• /
• pp.31-46
• /
• 2024

The aim of this paper is to present an approach to improve reverse Minkowski and Hölder-type inequalities using k-weighted fractional integral operators _a⁺𝔍^𝜇_w with respect to a strictly increasing continuous function 𝜇, by introducing two parameters of integrability, p and q. For various choices of 𝜇 we get interesting special cases.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.3
• /
• pp.25-33
• /
• 2015

As a reversible Jacket is having the compatibility of two sided wearing, the matrix that both the inside and the outside are compatible is called Jacket matrix, and the matrix is having both inside and outside by the processes of element-wise inverse and block-wise inverse. This concept had been completed by one of the authors Moon Ho Lee in 1989, and finally that resultant matrix has been christened as Jacket matrix, in 2000. This is the most generalized extension of the well known Hadamard matrices, which includes both orthogonal and non-orthogonal matrices. This matrix addresses many problems in information and communication theories. we investigate the properties of the Jacket matrix, i.e. determinants, eigenvalues, and kronecker product. These computations are very useful for signal processing and orthogonal codes design. In our proposal, we provide some results to calculate these values by using a very simple mathematical model with less complexity.