• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.13 no.1
• /
• pp.343-347
• /
• 2012

Non-linear equalization techniques using decision feedback structure are highly demanded for cancellation of intersymbol interferences occurred in severe channel environments. In this paper decision feedback structure is applied to the linear blind equalizer algorithm that is based on information theoretic learning and a randomly generated symbol set. At the decision feedback equalizer (DFE) the random symbols are generated to have the same probability density function (PDF) as that of the transmitted symbols. By minimizing difference between the PDF of blind DFE output and that of randomly generated symbols, the proposed DFE algorithm produces equalized output signal. From the simulation results, the proposed method has shown enhanced convergence and error performance compared to its linear counterpart.

• Journal of Communications and Networks
• /
• v.12 no.5
• /
• pp.399-405
• /
• 2010

Blind equalization techniques have been used in broadcast and multipoint communications. In this paper, two criteria of minimizing Euclidian distance between two probability density functions (PDFs) for adaptive blind equalizers are presented. For PDF calculation, Parzen window estimator is used. One criterion is to use a set of randomly generated desired symbols at the receiver so that PDF of the generated symbols matches that of the transmitted symbols. The second method is to use a set of Dirac delta functions in place of the PDF of the transmitted symbols. From the simulation results, the proposed methods significantly outperform the constant modulus algorithm in multipath channel environments.

• Bulletin of the Korean Mathematical Society
• /
• v.54 no.6
• /
• pp.2013-2027
• /
• 2017

We compute explicitly the matrices represented by Toeplitz operators on the Hardy space over the unit circle with respect to a special orthonormal basis constructed by author in terms of their symbols. And we also find a necessary condition for the matrix generated by the product of two Toeplitz operators with respect to the basis to be a Toeplitz matrix by a direct calculation and we finally solve commuting problems of two Toeplitz operators in terms of symbols. This is a generalization of the classical results obtained regarding to the orthonormal basis consisting of the monomials.

• Journal of Information Processing Systems
• /
• v.12 no.2
• /
• pp.322-331
• /
• 2016

Image compression is an essential technique for saving time and storage space for the gigantic amount of data generated by images. This paper introduces an adaptive source-mapping scheme that greatly improves bit-level lossless grayscale image compression. In the proposed mapping scheme, the frequency of occurrence of each symbol in the original image is computed. According to their corresponding frequencies, these symbols are sorted in descending order. Based on this order, each symbol is replaced by an 8-bit weighted fixed-length code. This replacement will generate an equivalent binary source with an increased length of successive identical symbols (0s or 1s). Different experiments using Lempel-Ziv lossless image compression algorithms have been conducted on the generated binary source. Results show that the newly proposed mapping scheme achieves some dramatic improvements in regards to compression ratios.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.1A
• /
• pp.35-40
• /
• 2011

The complex-valued blind algorithm based on a set of randomly generated symbols and Euclidean distance can take advantage of information theoretic learning and cope with the channel phase rotation problems. On the algorithm, in this paper, the effect of kernel size has been studied and a kernel-modified version of the algorithm that rearranges the forces between the information potentials by kernel-modification has been proposed. In simulation results for 16 QAM and complex-channel models, the proposed algorithm show significantly enhanced performance of symbol-point concentration and no phase rotation problems caused by the complex channel models.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.1
• /
• pp.26-32
• /
• 2013

Blind algorithms based on Information potential of output samples and a set of symbols generated in random order at the receiver go through performance degradation when biased impulsive noise is added to the channel since the cost function composed of information potentials has no variable to deal with biased signal. Aiming at the robustness against biased impulsive noise, we propose, in this paper, a modified information potential, and derived related blind algorithms based on augmented filter structures and a set of random-order symbols. From the simulation results of blind equalization for multipath channels, the blind algorithm based on the proposed information potential produced superior convergence performance in the environments of strong biased impulsive noise.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.9
• /
• pp.76-84
• /
• 1999

EZW proposed by Shapiro is based on a zerotree constructed in a way that a parent coefficient in a subband is related to four child coefficients in the next finer subband of similar orientation. This fixed treeing based on 1-to-4 parent-child is suitable to exploti hierachical correlations among subbands but not to exploit spatial correlations within a subband. A new treeing by Joo, et al. is suggested to simulatneously exploit those two correlatins by extending parent-child relationship in a flexible way. The flexible treeing leads to increasing the number of symbols and lowering entorpy comparing to the fixed treeing, and therefore a better compression can be resulted. In this paper, we suggest two techniques to suppress the increasing of symbols. First, a probing bit is generated to avoid redundant scan for insignivicant coefficients. Second, since all subbands do not always require the same kind of symbol-set, produced symbols are re-symbolized into binary codes according to a pre-defined procedure. Owing to those techniques, all symbols are generated as binary codes. The binary symbols can be entropy-coded by an adaptive arithmetic coding. Moerover, the binary symbol stream can give comparatively good performances without help of additional entropy coding. Our proposed coding scheme is suggested in two modes: binary coding mode and arithmetic coding mode. We evaluate the effectivenessof our modifications by comparing with the original EZW.

• Journal of Internet Computing and Services
• /
• v.10 no.1
• /
• pp.11-17
• /
• 2009

Blind equalization techniques have been used in multipoint communication on which the research on the internet has focused. In this paper, a criterion of minimizing Euclidian Distance between two PDFs for adaptive blind equalizers has been presented. In order for ED expressed with Parzen PDFs to be minimized, we propose to use a set of randomly generated desired symbols at the receiver so that the PDF of the generated symbols matches that of the transmitted symbols. From the simulation results, the proposed method has shown superior error performance even in severe channel environments in which CMA has shown severe performance degradation. This indicates that the proposed algorithm can be considered relatively insensitive to ESR variations compared to CMA. As a field of ITL, ED minimization using Parzen PDFs has shown possibilities of being successfully applied to blind equalization.

• 전자공학회논문지 IE
• /
• v.47 no.3
• /
• pp.35-40
• /
• 2010

In this paper, we propose an algorithm to improve the precision of initial carrier-frequency offset estimation for multiband-OFDM (MB-OFDM) UWB system which is considering the quantization-noise effect. In the general OFDM system, the two adjacent and repeated preamble symbols are used for the initial carrier-frequency synchronization while the performance of the frequency-offset estimation is bounded by quantization effect generated from analog-to-digital conversion at the receiver. This paper proposes a method in which one-symbol interval between two adjacent preamble symbols for the initial frequency synchronization is extended to multiple-symbol interval between non-adjacent symbols in an extent that phase ambiguity does not occur. In this paper, we also present '6' as optimal multiple symbol interval for the MB-OFDM system with 30 preamble symbols on 3-band hopping and with 4-bit A/D conversion at the receiver. Under the channel environments for the MB-OFDM UWB system, the simulation results show that the proposed estimation algorithm can achieve the initial estimation in offset precision less than 5 ppm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.9C
• /
• pp.855-862
• /
• 2009

The path key establishment phase in the wireless sensor network is vulnerable to Byzantine attack. Huang and Hedhi proposed a Byzantine resilient multi-key establishment scheme using a systematic RS code, which has shortcomings of exposing a part of message symbols and inefficient transmission. In this paper, we propose a new Byzantine resilient multi-path key establishment scheme in which direct message symbols are not exposed to an adversary and are more efficiently transmitted the RS-encoded symbols to the destination node. In the Proposed scheme, a non-systematic RS code is used to transmit a generated indirect secret key and each encoded symbol is relayed through available paths between two sensor nodes. If enough symbols are collected at the destination node, it is possible to reconstruct the secret message through RS decoding.