• 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 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 Internet Computing and Services
• /
• v.21 no.2
• /
• pp.49-55
• /
• 2020

Information theoretic learning (ITL) methods based on random symbols (RS) use a set of random symbols generated according to a target distribution and are designed nonparametrically to minimize the cost function of the Euclidian distance between the target distribution and the input distribution. One drawback of the learning method is that it can not utilize the input power statistics by employing a constant stepsize for updating the algorithm. In this paper, it is revealed that firstly, information potential input (IPI) plays a role of input in the cost function-derivative related with information potential output (IPO) and secondly, input itself does in the derivative related with information potential error (IPE). Based on these observations, it is proposed to normalize the step-size with the statistically varying power of the two different inputs, IPI and input itself. The proposed algorithm in an communication environment of impulsive noise and multipath fading shows that the performance of mean squared error (MSE) is lower by 4dB, and convergence speed is 2 times faster than the conventional methods without step-size normalization.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.4
• /
• pp.1951-1956
• /
• 2013

Distribution-matching type algorithms based on a set of symbols generated in random order provide a limited performance under biased impulsive noise since the performance criterion for the algorithms has no variables for biased signal. For the immunity against biased impulsive noise, we propose, in this paper, a modified performance criterion and derived related blind algorithms based on augmented filter structures and the distribution-matching method using a set of random symbols. From the simulation results, the proposed algorithm based on the proposed criterion yielded superior convergence performance undisturbed by the strong biased impulsive noise.

• The Journal of the Acoustical Society of Korea
• /
• v.22 no.1E
• /
• pp.26-32
• /
• 2003

We propose new time-frequency (TF) tools for analyzing linear time-varying (LTV) systems and nonstationary random processes showing hyperbolic TF structure. Obtained through hyperbolic warping the narrowband Weyl symbol (WS) and spreading function (SF) in frequency, the new TF tools are useful for analyzing LTV systems and random processes characterized by hyperbolic time shifts. This new TF symbol, called the hyperbolic WS, satisfies the hyperbolic time-shift covariance and scale covariance properties, and is useful in wideband signal analysis. Using the new, hyperbolic time-shift covariant WS and 2-D TF kernels, we provide a formulation for the hyperbolic time-shift covariant TF symbols, which are 2-D smoothed versions of the hyperbolic WS. We also propose a new interpretation of linear signal transformations as weighted superposition of hyperbolic time shifted and scale changed versions of the signal. Application examples in signal analysis and detection demonstrate the advantages of our new results.

• Journal of Internet Computing and Services
• /
• v.15 no.4
• /
• pp.119-124
• /
• 2014

Blind adaptive systems based on the Euclidean distance (ED) between the distribution function of the output samples and that of a set of random symbols generated at the receiver matching with the distribution function of the transmitted symbol points estimate the ED at each iteration time to examine its convergence state or its minimum ED value. The problem is that this ED estimation obtained by block?data processing requires a heavy calculation burden. In this paper, a recursive ED estimation method is proposed that reduces the computational complexity by way of utilizing the relationship between the current and previous states of the datablock. The relationship provides a ground that the currently estimated ED value can be used for the estimation of the next ED without the need for processing the whole new data block. From the simulation results the proposed recursive ED estimation shows the same estimation values as that of the conventional method, and in the aspect of computational burden, the proposed method requires only O(N) at each iteration time while the conventional block?processing method does $O(N^2)$.

• ETRI Journal
• /
• v.35 no.4
• /
• pp.714-717
• /
• 2013

Peak power reduction techniques in orthogonal frequency division multiplexing (OFDM) has been an important subject for many researchers for over 20 years. In this letter, we propose a side-information-free technique that is based on the concept of random variable (RV) transformation. The suggested method transforms RVs into other RVs, aiming to reshape the constellation that will consequently produce OFDM symbols with a reduced peak-to-average power ratio. The proposed method has no limitation on the mapping type or the mapping order and has no significant effect on the bit error rate performance compared to other methods presented in the literature. Additionally, the computational complexity does not increase.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.9
• /
• pp.995-1000
• /
• 2016

The maximum cross-correntropy (MCC) algorithm with a set of random symbols keeps its optimum weights undisturbed from impulsive noise unlike MSE-based algorithms and its main factor has been known to be the input magnitude controller (IMC) that adjusts the input intensity according to error power. In this paper, a normalization of the step size of the MCC algorithm by the power of IMC output is proposed. The IMC output power is tracked recursively through a single-pole low-pass filter. In the simulation under impulsive noise with two different multipath channels, the steady state MSE and convergence speed of the proposed algorithm is found to be enhanced by about 1 dB and 500 samples, respectively, compared to the conventional MCC algorithm.

• Journal of Communications and Networks
• /
• v.12 no.4
• /
• pp.308-316
• /
• 2010

The problem of compressed sensing (CS) based multiple access is studied under the assumption of random data traffic. In many multiple access systems, i.e., wireless sensor networks (WSNs), data arrival is random due to the bursty data traffic for every transmitter. Following the recently developed CS methodology, the technique of compressing the transmitter identities into data transmissions is proposed, such that it is unnecessary for a transmitter to inform the base station its identity and its request to transmit. The proposed compressed multiple access scheme identifies transmitters and recovers data symbols jointly. Numerical simulations demonstrate that, compared with traditional multiple access approaches like carrier sense multiple access (CSMA), the proposed CS based scheme achieves better expectation and variance of packet delays when the traffic load is not too small.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 1997.11a
• /
• pp.127-135
• /
• 1997

In this paper, we apply a digital modulation scheme called Multi-Carrier Code Division Multiple Access (MC-CDMA) in which data symbols are transmitted at multiple subcarriers. Each subcarrier is encoded with a phase offset of -π or π based on a pseudo-random noise(PN) sequence. MC-CDMA scheme is introduced to combat against the multipath fading. We annalize above system and derive the average probability of error in AWGN and Rayleigh fading environment.