• 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 the Korean Institute of Intelligent Systems
• /
• v.11 no.7
• /
• pp.628-632
• /
• 2001

We propose time-frequency (TF) tools for analyzing linear time-varying (LTV) systems and nonstationary random processes. Obtained warping the narrowband Weyl symbol (WS) and spreading function (SF), the new TF tools are useful for analyzing LTV systems and random processes characterized by generalized frequency shifts, This new Weyl symbol (WS) is useful in wideband signal analysis. We also propose WS an tools for analyzing systems which produce dispersive frequency shifts on the signal. We obtain these generalized, frequency-shift covariant WS by warping conventional, narrowband WS. Using the new, generalized WS, we provide a formulation for the Weyl correspondence for linear systems with instantaneous of linear signal transformation as weighted superpositions of non-linear frequency shifts on the signal. Application examples in signal and detection demonstrate the advantages of our new results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.6A
• /
• pp.659-665
• /
• 2008

If ranging processes are not frequent in an uplink OFDMA system, the timing synchronization between base and mobile stations may not be maintained. Especially in the case of infrequent random accesses in a large cell, timing offsets can be considerable and the destroyed orthogonality of OFDMA signals may result in the degraded performance. This paper proposes a novel random access scheme for uplink OFDMA systems, which support the orthogonality of OFDMA signals with timing offsets by allowing a random access OFDMA symbol shorter than a normal one. In order to make uplink OFDMA systems robust to timing offsets, the proposed scheme inserts a zero-padding region in an OFDMA symbol.

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

• Journal of information and communication convergence engineering
• /
• v.16 no.3
• /
• pp.166-172
• /
• 2018

A pseudo-random sequence generated by using a primitive polynomial, trace function, and Legendre symbol has been researched in our previous work. Our previous sequence has some interesting features such as period, autocorrelation, and linear complexity. A pseudo-random sequence widely used in cryptography. However, from the aspect of the practical use in cryptographic systems sequence needs to generate swiftly. Our previous sequence generated by utilizing a primitive polynomial, however, finding a primitive polynomial requires high calculating cost when the degree or the characteristic is large. It’s a shortcoming of our previous work. The main contribution of this work is to find some relation between the generated sequence and irreducible polynomials. The purpose of this relationship is to generate the same sequence without utilizing a primitive polynomial. From the experimental observation, it is found that there are (p - 1)/2 kinds of polynomial, which generates the same sequence. In addition, some of these polynomials are non-primitive polynomial. In this paper, these relationships between the sequence and the polynomials are shown by some examples. Furthermore, these relationships are proven theoretically also.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.5C
• /
• pp.432-438
• /
• 2010

In this paper we study the effect of bit-to-symbol mappings on the convergence behavior of turbo equalizers employing low-density parity-check (LDPC) codes over high order modulations. We analyze the effective SNR of the outputs from linear minimum mean-squared error (MMSE) equalizers and the convergence property of LDPC decoding for different symbol mappings. Numerical results show that the bit-reliability (BR) mapping provides better performance than random mapping in LDPC-coded turbo equalizers over high order modulations. We also verify the effect of symbol mappings through the noise threshold and error performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.11C
• /
• pp.932-939
• /
• 2008

Recently lattice-reduction (LR) has been used in signal detection for multiple-input multiple-output (MIMO) systems. The conventional LR aided detection schemes are combinations of LR and signal detection methods such as zero-forcing (ZF) and minimum mean square error (MMSE) detection. In this paper, we propose the Lattice-Reduction-aided scheme based on extended noise variance matrix to search good candidate symbol set in quantization step. Then this scheme estimates transmitted symbol with Semidefinite Relaxation by candidate symbol set. Simulation results in a random MIMO system show that the proposed scheme exhibits improved performance and a slight increase in complexity.

• Journal of Internet Computing and Services
• /
• v.11 no.5
• /
• pp.19-26
• /
• 2010

The criterionmaximizing cross-correntropy (MCC) of two different random variables has yielded superior performance comparing to mean squared error criterion. In this paper we present a complex-valued blind equalizer algorithm for QAM and complex channel environments based on cross-correntropy criterion which uses, as two variables, equalizer output PDF and Parzen PDF estimate of a self-generated symbol set. Simulation results show significantly enhanced performance of symbol-point concentration with no phase rotation in complex-channel communication.

• Communications of the Korean Mathematical Society
• /
• v.18 no.1
• /
• pp.117-126
• /
• 2003

Let {$X_{nk}$\mid$1\;{\leq}\;k\;{\leq}\;n,\;n\;{\geq}\;1$} be an array of row negatively associated (NA) random variables which satisfy $P($\mid$X_{nk}$\mid$\;>\;x)\;{\leq}\;P($\mid$X$\mid$\;>\;x)$. For weighed sums ${{\Sigma}_{k=1}}^{Tn}\;a_kX_{nk}$ indexed by random variables {$T_n$\mid$n\;{\geq}$1$}, we establish a general weak law of large numbers (WLLN) of the form $({{\Sigma}_{k=1}}^{Tn}\;a_kX_{nk}\;-\;v_{[nk]})\;/b_{[an]}$ under some suitable conditions, where $\{a_n$\mid$n\;\geq\;1\},\; \{b_n$\mid$n\;\geq\;1\}$ are sequences of constants with $a_n\;>\;0,\;0\;<\;b_n\;\rightarrow \;\infty,\;n\;{\geq}\;1$, and {$v_{an}$\mid$n\;{\geq}\;1$} is an array of random variables, and the symbol [x] denotes the greatest integer in x.

• IEIE Transactions on Smart Processing and Computing
• /
• v.4 no.6
• /
• pp.443-449
• /
• 2015

This paper considers the physical layer security problem for a two-way vehicle-to-vehicle network, where the two source vehicles can only exchange information through an untrusted relay vehicle. The relay vehicle helps the two-way transmission but also acts as a potential eavesdropper. Each vehicle has a random velocity. By exploiting the random carrier frequency offsets (CFOs) caused by random motions, a secure double-differential two-way relay scheme is proposed. While achieving successful two-way transmission for the source vehicles, the proposed scheme guarantees a high decoding error floor at the untrusted relay vehicle. Average symbol error rate (SER) performance for the source vehicles and the untrusted relay vehicle is analyzed. Simulation results are provided to verify the proposed scheme.