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

• Journal of Korea Society of Industrial Information Systems
• /
• v.27 no.5
• /
• pp.25-36
• /
• 2022

This paper proposes a random sign reversal technique in space frequency block code for single carrier modulation. The traditional space time and frequency block coding technique may be confronted with radio environments openly, severe radio hijacking problems are to be overcome. In order to avoid such an open radio issue, random coded data protection technique for space-time block code was proposed, but this algorithm can change channel combination per an Orthogonal Frequency Division Multiplexing block. This kind of slow switching increases the probability that nearby receivers will detect the transmitted data. This paper proposes a fast switching algorithm per data symbols' basis which is a random sign reversal technique in space frequency block code for Single Carrier Modulation. It is shown in simulation that the proposed one has a superior performance in comparison with the performance of the receiver which do not know the random timing sequence of sign reversal.

• International Journal of Computer Science & Network Security
• /
• v.22 no.11
• /
• pp.241-247
• /
• 2022

Ad hoc network is self-organized network powered by battery. The reliability of virtual user identification and channel security are reduced when SNR is low due to limited user energy. In order to solve this problem, a joint virtual user identification and channel security en/decoding method is proposed in this paper. Transmitter-receiver-based virtual user identification code is generated by executing XOR operation between orthogonal address code of transmitter and pseudo random address code of receiver and encrypted by channel security code to acquire orthogonal random security sequence so as to improve channel security. In order to spread spectrum as well as improve transmission efficiency, data packet is divided into 6-bit symbols, each symbol is mapped with an orthogonal random security sequence. Subspace-based method is adopted by receiver to process received signal firstly, and then a judgment model is established to identify virtual users according to the previous processing results. Simulation results indicate that the proposed method obtains 1.6dB E_b/N₀ gains compared with reference methods when miss alarm rate reaches 10^-3.

• The Journal of Korea Robotics Society
• /
• v.8 no.3
• /
• pp.217-227
• /
• 2013

We introduce a learning system for the sight reading of simple drum sequences. Sight reading is a cognitive-motor skill that requires reading of music symbols and actions of multiple limbs for playing the music. The system provides knowledge of results (KR) pertaining to the learner's performance by color-coding music symbols, and guides the learner by indicating the corresponding action for a given music symbol using additional auditory or vibrotactile cues. To evaluate the effects of KR and guidance cues, three learning methods were experimentally compared: KR only, KR with auditory cues, and KR with vibrotactile cues. The task was to play a random 16-note-long drum sequence displayed on a screen. Thirty university students learned the task using one of the learning methods in a between-subjects design. The experimental results did not show statistically significant differences between the methods in terms of task accuracy and completion time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.9
• /
• pp.1786-1792
• /
• 2015

Random linear network coding (RLNC) is widely employed to enhance the reliability of wireless multicast. In RLNC encoding/decoding, Galois Filed (GF) arithmetic is typically used since all the operations can be performed with symbols of finite bits. Considering the architecture of commercial computers, the complexity of arithmetic operations is constant regardless of the dimension of GF m, if m is smaller than 32 and pre-calculated tables are used for multiplication/division. Based on this, we show that the complexity of RLNC inversely proportional to m. Considering additional overheads, i.e., the increase of header length and memory usage, we determine the practical value of m. We implement RLNC in a commercial computer and evaluate the codec throughput with respect to the type of the tables for multiplication/division and the number of original packets to encode with each other.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.3
• /
• pp.1193-1209
• /
• 2015

Network coding is promising to maximize network throughput and improve the resilience to random network failures in various networking systems. In this paper, the problem of providing efficient confidentiality for practical network coding system against a global eavesdropper (with full eavesdropping capabilities to the network) is considered. By exploiting a novel combination between the construction technique of systematic Maximum Distance Separable (MDS) erasure coding and traditional cryptographic approach, two efficient schemes are proposed that can achieve the maximum possible rate and minimum encryption overhead respectively on top of any communication network or underlying linear network code. Every generation is first subjected to an encoding by a particular matrix generated by two (or three) Vandermonde matrices, and then parts of coded vectors (or secret symbols) are encrypted before transmitting. The proposed schemes are characterized by tunable and measurable degrees of security and also shown to be of low overhead in computation and bandwidth.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.2
• /
• pp.1-10
• /
• 1997

In this paper, an improved lower bound on the burst-error correcting capability of th ecyclic product code is presented and through the analysis of this new bound clustered cyclic product (CCP abbr.)code is proposed. The CCP code, to improve the burst-error correcting capability, combines the idea of clustering and the transmission method of cyclic product code. That is, a cluster which is defined in this paper as a group of consecutive code symbols is employed as a new transmission unit to the code array transmission of cyclic product code. the burst-error correcting capability of the CCP code is improved without a loss in the random-error correcting capability and performance comparison in the digital video camera records (DVCR) system shows the superiority of the proposed CCP code over conventional product codes.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.8 no.3
• /
• pp.111-115
• /
• 2009

Cognitive Radio (CR) technology is proposed for using the unused spectrum band efficiently because of the spectrum scarcity problems. Spectrum sensing is one of the most challenging issues in cognitive radio system. In this paper, we focus on the signal detection of WiBro system band. As most of the modulated signals can be treated as cyclostationary random process, we can detect the signal of the OFDM signals in WiBro system. OFDM symbols using WiBro system have several pilot subcarriers and periodic pilots have cyclostationary characteristic. To improve the detection performance, we get diversity gain using multiple antennas.

• Journal of Korea Multimedia Society
• /
• v.9 no.12
• /
• pp.1689-1699
• /
• 2006

A nonlinear channel blind equalizer by using a hybrid genetic algorithm, which merges a genetic algorithm with simulated annealing, and a RBF network is presented. In this study, a hybrid genetic algorithm is used to estimate the output states of a nonlinear channel, based on the Bayesian likelihood fitness function, instead of the channel parameters. From these estimated output states, the desired channel states of the nonlinear channel are derived and placed at the center of a RBF equalizer to reconstruct transmitted symbols. In the simulations, binary signals are generated at random with Gaussian noise. The performance of the proposed method is compared with those of a conventional genetic algorithm(GA) and a simplex GA, and the relatively high accuracy and fast convergence of the method are achieved.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.106-109
• /
• 1998

Wireless communication systems, in particular, must operate in a crowded electro-magnetic environmnet where in-band undesired signals are treated as noise by the receiver. These interfering signals are often random but not Gaussian Due to nongaussian noise, the distribution of the observables cannot be specified by a finite set of parameters; instead r-dimensioal sample space (pure noise samples) is equiprobably partitioned into a finite number of disjointed regions using quantiles and a vector quantizer based on training samples. If we assume that the detected symbols are correct, then we can observe the pure noise samples during the training and transmitting mode. The algorithm proposed is based on a piecewise approximation to a regression function based on quantities and conditional partition moments which are estimated by a RMSA (Robbins-Monro Stochastic Approximation) algorithm. In this paper, we develop a diversity combiner with modified detector, called Non-Linear Detector, and the receiver has a differential phase detector in each diversity branch and at the combiner each detector output is proportional to the second power of the envelope of branches. Monte-Carlo simulations were used as means of generating the system performance.