• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.578-582
• /
• 2009

Computer-Generated Hologram (CGH) is generally made by Fourier Transform. CGH is made by an optical reconstruction. Computer-Generated Pseudo Hologram (CGPH) is made up Complex Hadamard Transform instead of CGH which is made by the Fourier Transform. CGPH differs from CGH in point of view the possibility of optical reconstruction. There is an advantage that it cannot be optical reconstruction, in other word, physical leakage of the confidential information is impossible. In this paper, a binary image was converted in Complex Hadamard Transform, and CGPH was made. Improvement of the reconstructed image from CGPH is done by error diffusion method and iterative method. The result that the reconstructed image is improved is shown.

• Proceedings of the IEEK Conference
• /
• 2001.06a
• /
• pp.233-236
• /
• 2001

Orthogonal freqency division multiplexing (OFDM) is an attractive technique for achieving high-bit-rate wireless data transmission. However, the potentially large peak-to-average power ratio (PAPR) has limited its application; An OFDM signal with the large PAPR can cause power degradation (In-band distortion) and spectral spreading (Out-of-band distortion) by being clipped passing through a power amplifier. Thus, we propose the combining algorithm of Hadamard transform and phase shift, which is ascribed to the relation between the correlation of the IFFT input sequence function and PAPR. Extensive computer simulations show that the combining algorithm is an effective technique to reduce PAPR.

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

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.1
• /
• pp.119-126
• /
• 2012

H.264/AVC can use three transforms depending on types of residual data which are to be coded. H.264/AVC always executes $4{\times}4$ DCT transform. In $16{\times}16$ intra mode only, $4{\times}4$ Hadamard transform for luma DC coefficients and $2{\times}2$ Hadamard transform for chroma DC coefficients are performed additionally. Quantization is carried out to achieve further data compression after transform coding is completed. In this paper, the hardware implementation for DCT transform, Hadamard transform and quantization is studied. Especially, the proposed architecture adopting the pipeline technique can output a quantized result per clock cycle after 33-clock cycle latency. The proposed architecture is coded in Verilog-HDL and synthesized using Xilinx 7.1i ISE tool. The operating frequency is 106MHz at SPARTAN3S-1000. The designed IP can process maximum 33-frame at $1920{\times}1080$ HD resolution.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.11
• /
• pp.2512-2520
• /
• 1997

The classes of Reverse Jacket matrix [RJ]$_{N}$ and the corresponding Restclass Reverse Jacket matrix ([RRJ]$_{N}$) are defined;the main property of [RJ]$_{N}$ is that the inverse matrices of them can be obtained very easily and have a special structure. [RJ]$_{N}$ is derived from the weighted hadamard Transform corresponding to hadamard matrix [H]$_{N}$ and a basic symmertric matrix D. the classes of [RJ]$_{2}$ can be used as a generalize Quincunx subsampling matrix and serveral polygonal subsampling matrices. In this paper, we will present in particular the systematical block-wise extending-method for {RJ]$_{N}$. We have deduced a new orthorgonal matrix $M_{1}$.mem.[RRJ]$_{N}$ from a nonorthogonal matrix $M_{O}$.mem.[RJ]$_{N}$. These matrices can be used to develop efficient algorithms in IMT2000 signal processing, multidimensional subsampling, spectrum analyzers, and signal screamblers, as well as in speech and image signal processing.gnal processing.g.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1983.10a
• /
• pp.68-72
• /
• 1983

The Hadamard matrix is a symmetric matrix made of plus and minus ones as entries. There fore 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 matrix which 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 transform offers a useful facility in the digital signal processing. As the size of the transmission block increases, however, the assigment 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, and the unitform is 8$\times$8 matrix.

• Proceedings of the KIEE Conference
• /
• 1998.07b
• /
• pp.601-603
• /
• 1998

In this paper, Hadamard transform imaging spectrometers utilizing Grill spectrometers are proposed. General Hadamard Transform Spectrometers (HTS) carry out one-encoding through input masks, but Grill spectrometers carry out double-encoding through entrance and exit masks. Thus Grill spectrometers increase the signal-to-noise ratio by double-encoding. we reconfigure the system by using the Grill spectrometers which use a left cyclic S-matrix instead of the conventional right cyclic one. Then, we model the system and apply the mask characteristics method, i.e. $T^{I}$ method, to complete fast algorithm. Through computer simulations, we want to prove the superiority of the proposed system by comparing with the conventional HTS. From Observations concerning the average mean square error(AMSE) associated with estimates from the $T^{I}$ spectrum-recovery method, the relative performances of the two systems are compared.

• Journal of Communications and Networks
• /
• v.12 no.3
• /
• pp.240-245
• /
• 2010

Jacket matrices, motivated by the complex Hadamard matrix, have played important roles in signal processing, communications, image compression, cryptography, etc. In this paper, we suggest a novel approach to design a simple class of space-time block codes (STBCs) to reduce its peak-to-average power ratio. The proposed code provides coding gain due to the characteristics of the complex Hadamard matrix, which is a special case of Jacket matrices. Also, it can achieve full rate and full diversity with the simple decoding. Simulations show the good performance of the proposed codes in terms of symbol error rate. For generality, a kind of quasi-orthogonal STBC may be similarly designed with the improved performance.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1984.04a
• /
• pp.13-17
• /
• 1984

A hybrid version of the Hadamard and center Line Symmetric Haar Transform called H-CLSH is defined and developed. Efficient algorithms for fast computation of the H-CLSH and its inverse are developed. The H-CLSH is applied to digital signal and image processing and its utility and image processing and its utility and effectiveness are compared with Hadamard-Haar discrete transforms on the basis of some standard performance criteria.

• The KIPS Transactions:PartC
• /
• v.8C no.5
• /
• pp.499-506
• /
• 2001

In this work, we present an iris pattern recognition method as a biometrically based technology for personal identification and authentication For this, we propose a new algorithm for extracting an unique feature from the iris of the human eye and representing this feature using the discrete Walsh-Hadamard transform. From the computational simplicity of the adopted transform, this can perform the personal identification and authentication in a fast manner to accomplish the information security.