• 한국지능시스템학회논문지
• /
• 제11권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.

• 한국산업정보학회논문지
• /
• 제27권5호
• /
• pp.25-36
• /
• 2022

본 논문은 단일 반송파 변조를 위한 공간 주파수 블록 코드에서의 랜덤 부호 반전 기술을 제안한다. 종래의 시공간 그리고 공간 주파수 블록 코드는 전파 환경이 공개되어 있으므로 심각한 전파 탈취 문제를 극복해야 한다. 이러한 전파 공개 문제를 피하기 위해, 시공간 블록 코드를 위한 랜덤 코드 데이터 보호 방법이 제안되어 있지만, 이 알고리즘은 직교 주파수 분할 다중화 블록별로 채널 결합을 바꿀 수 있는데, 이와 같은 종류의 느린 스위칭은 근처의 수신기들이 전송된 데이터를 검출할 확률을 증가시킨다. 이 논문은 데이터 심볼 기반의 빠른 스위칭 알고리즘 즉, 단일 반송파 변조를 위한 공간 주파수 블록 코드에서의 랜덤 부호 반전 기술을 제안한다. 모의실험 결과는 제안하는 알고리즘이 랜덤 부호 반전 타이밍 시퀀스를 모르는 수신기의 성능과 비교하여 우수한 성능을 보유하고 있다는 것을 나타내었다.

• International Journal of Computer Science & Network Security
• /
• 제22권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.

• 로봇학회논문지
• /
• 제8권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.

• 한국통신학회논문지
• /
• 제40권9호
• /
• pp.1786-1792
• /
• 2015

랜덤 선형 네트워크 코딩(Random Linear Network Coding, RLNC)은 멀티캐스트의 신뢰성을 높이는 방법으로 널리 사용되고 있다. RLNC 구현에 있어서 효율적인 연산을 위해 Galois Field (GF)를 사용한다. 상용 컴퓨터에서의 연산을 고려하였을 때 GF($2^m$)의 크기 m이 32보다 작을 경우, 곱셈과 나눗셈에 대해 사전에 계산된 table을 사용하면 모든 사칙 연산이 m에 관계없이 상수 복잡도를 가진다. 이로부터 RLNC의 연산 복잡도는 m에 반비례하는 것을 보인다. 추가적으로, m이 커짐에 따라 발생하는 헤더 길이 증가, 메모리 사용량 증가 등의 추가적인 오버헤드를 고려하여 실용적인 GF의 크기를 선택한다. 이를 바탕으로 상용 컴퓨터에 RLNC를 구현하고 곱셈/나눗셈 연산 시에 사용되는 table의 종류와 한 번에 인코딩 되는 원본 패킷의 개수에 따른 성능을 실측한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권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.

• 전자공학회논문지S
• /
• 제34S권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.

• 정보통신설비학회논문지
• /
• 제8권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.

• 한국멀티미디어학회논문지
• /
• 제9권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.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 하계종합학술대회논문집
• /
• 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.