• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.9 no.2
• /
• pp.96-103
• /
• 2010

This paper studies the performance of STTC with minimum Hamming distance (MHD) mapping in order to improve the bit error rate (BER) performance. Unfortunately, the MHD mapping used in trellis coded modulation (TCM) or multiple trellis coded modulation (MTCM) cannot be directly applied to STTC because the trellis structure of STTC is generally different from that of TCM or MTCM. Therefore, we need a simple modification to apply the MHD mapping concept in STTC. The core of the modification assigns information bits with a Hamming distance in proportion to the sum of the Euclidean distance to trellis branch of STTC. To the best knowledge, this combination has not been considered yet. The BER performance is examined with simulations and the performance of MHD mapping is compared to that of well known natural mapping and Gray mapping on both fast Rayleigh as well as fast Rician fading channels. It is shown that the performance of MHD mapping is much better than that of natural mapping or Gray mapping over fast Rician fading channels, especially.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.12 no.3
• /
• pp.417-424
• /
• 2001

This paper proposes new symbol mapping method that can enhance the performance of trellis coded M-ary PSK compared with conventional symbol mapping methods in AWGN environment. Since the basic criteria of TCM design is Maximum Euclidean distance in AWGN, conventional symbol mapping method keep this basic criteria. In this paper, proposed new symbol mapping method uses both Euclidean distance and Hamming distance to design, while conventional methods make use of only optimal Euclidean distance. New symbol mapping method show the better BER performance than the other through computer simulation and error equations.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.11
• /
• pp.42-48
• /
• 1990

In this paper robust test generation for stuck-open faults in CMOS circuits is proposed. By obtaining initialization patterns and test patterns using the relationship of bit position and Hamming weight among input vectors for CMOS circuit test generation time for stuck-open faults can be reduced, and the problem of input transition skew which make fault detection difficult is solved, and the number of test sequences are minimized. Also the number of test sequences is reduced by arranging test sequences using Hamming distance between initialization patterns and test patterns for circuit.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1535-1538
• /
• 2002

The flexibility of content addressable mem-ory (CAM) can greatly be extended through the use of trits (ternary digits) Trits consist of binary logical values “0” and “1” with addition of “x” (“dont’t care”). The “dont’t care“is extremely useful for providing com- pact representation of sets of bit strings. In this paper, we propose a new ternary CAM with Hamming distance search functions. Each memory cell in the CAM consists of a pair of lambda diodes which can store trits, namely, a logical “0”, “1” and “x” (“dont’t care“). The CAM can compare stored data and an input data in parallel, and find stored data with Hamming distance within a certain range (“near match“). Also, the interrogation characteristics of the ternary CAM are analyzed in detail. Furthermore, the results obtained these analyses are fully confirmed by simulation using the circuit analysis program HSPICE.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.3
• /
• pp.554-559
• /
• 2009

This paper proposes a new method of weighted template matching fur machine-printed numeral recognition. The proposed weighted template matching, which emphasizes the feature of a pattern using adaptive Hamming distance on local feature areas, improves the recognition rate while template matching processes an input image as one global feature. The experiment compares confusion matrices of the template matching, error back propagation neural network classifier, and the proposed weighted template matching respectively. The result shows that the proposed method improves fairly the recognition rate of the machine-printed numerals.

• Journal of the Korean Data and Information Science Society
• /
• v.23 no.2
• /
• pp.227-234
• /
• 2012

Hamming distances in medical science are used for the diagnosis of diseases. The differences of the distances, however, are often very small, and is not in the general statistical form such as normal or chi-square distribution. In this study, we explore the characteristics and significance of the differences of Hamming distances generated in medical diagnosis.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.2
• /
• pp.457-476
• /
• 2011

This paper presents an improved XOR-based Data Hiding Scheme (XDHS) to hide a halftone image in more than two halftone stego images. The hamming weight and hamming distance is a very important parameter affecting the quality of a halftone image. For this reason, we proposed a method that involves minimizing the hamming weights and hamming distances between the stego image and cover image in $2{\times}2$-pixel grids. Moreover, our XDHS adopts a block-wise operation to improve the quality of a halftone image and stego images. Furthermore, our scheme improves security by using a block-wise operation with A-patterns and B-patterns. Our XDHS method achieves a high quality with good security compared to the prior arts. An experiment verified the superiority of our XDHS compared with previous methods.

• Journal of the Institute of Convergence Signal Processing
• /
• v.14 no.4
• /
• pp.217-221
• /
• 2013

Recently, researches for methods of generating binary feature descriptors have been actively done. Since matching of binary feature descriptors uses Hamming distance which is based on bit operations, it is much more efficient than that of previous general feature descriptors which uses Euclidean distance based on real number operations. However, since increase in the number of features linearly drops matching speed, in applications such as object tracking where real-time applicability is a must, there has been an increasing demand for methods of further improving the matching speed of binary feature descriptors. In this regard, this paper proposes a method that improves the matching speed greatly while maintaining the matching accuracy by splitting high dimensional binary feature descriptors to several low dimensional ones and sequentially analyzing their partial Hamming distances. To evaluate the efficiency of the proposed method, experiments of comparison with previous matching methods are conducted. In addition, this paper discusses schemes of generating binary feature descriptors for maximizing the performance of the proposed method. Based on the analysis on the performance of several generation schemes, we try to find out the most effective scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.6A
• /
• pp.438-449
• /
• 2012

This paper presents new CRC-p codes for VHF band maritime wireless communication system based on performance analysis of various CRC codes. For this purpose, we firstly describe the method of determination of undetected error probability and minimum Hamming distance according to variation of CRC codeword length. By using the fact that the dual code of cyclic Hamming code and primitive BCH code become maximum length codes, we present an algorithm for computation of undetected error probability and minimum Hamming distance where the concept of simple hardware that is consisted of linear feedback shift register is utilized to compute the weight distribution of CRC codes. We also present construction of transmit data frame of VHF band maritime wireless communication system and specification of major communication parameters. Finally, new optimal CRC-p codes are presented based on the simulation results of undetected error probability and minimum Hamming distance using the various generator polynomials of CRC codes, and their performances are evaluated with simulation results of bit error rate based on the Rician maritime channel model and ${\pi}$/4-DQPSK modulator.

• Journal of Advanced Navigation Technology
• /
• v.15 no.5
• /
• pp.781-788
• /
• 2011

A sphere-packing problem is to find an arrangement of the spheres to fill as large area of the given space as possible, and covering problems are optimization problems which are dual problems to the packing problems. We generalize the concepts of the weight and the Hamming distance for a binary code to those of Boolean algebra. In this paper, we define a weight and a distance on a Boolean algebra and research some properties of the weight and the distance. Also, we prove the notions of the sphere-packing bound and the Gilbert-Varshamov bound on Boolean algebra.