• Journal of Communications and Networks
• /
• v.7 no.3
• /
• pp.243-247
• /
• 2005

We propose an efficient block least-mean-square (BLMS) adaptive algorithm, in conjunction with error control coding, for direct-sequence code division multiple access (DS-CDMA) systems. The proposed adaptive receiver incorporates decision feedback detection and channel encoding in order to improve the performance of the standard LMS algorithm in convolutionally coded systems. The BLMS algorithm involves two modes of operation: (i) The training mode where an uncoded training sequence is used for initial filter tap-weights adaptation, and (ii) the decision-directed where the filter weights are adapted, using the BLMS algorithm, after decoding/encoding operation. It is shown that the proposed adaptive receiver structure is able to compensate for the signal-to­noise ratio (SNR) loss incurred due to the switching from uncoded training mode to coded decision-directed mode. Our results show that by using the proposed adaptive receiver (with decision feed­back block adaptation) one can achieve a much better performance than both the coded LMS with no decision feedback employed. The convergence behavior of the proposed BLMS receiver is simulated and compared to the standard LMS with and without channel coding. We also examine the steady-state bit-error rate (BER) performance of the proposed adaptive BLMS and standard LMS, both with convolutional coding, where we show that the former is more superior than the latter especially at large SNRs ($SNR\;\geq\;9\;dB$).

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04d
• /
• pp.49-51
• /
• 2003

가입자망과 메트로 광 가입자망에서 광범위한 적용범위에 대해 광 기술을 선도하는 기존의 WDM은 증가하는 사용자 수를 수용하는 데 어려움을 가지며 WDM은 채널간의 잡음에 의한 제한과 유효 채널의 최대가 WDM 채널에서 광 증폭기 이득의 균일성에 의해 제한받는다. 따라서 사용자 수를 증가시키고 데이터량을 확장시킬 수 있는 CDMA 기술 도입이 하나의 대안으로 요구된다. 본 논문에서는 SMF에서 수십 km 거리를 갖는 가입자망에서 Prime sequence code를 사용한 2.5Gb/s 광 COMA 신호의 색분산 패널티에 대해 연구하였다. 시스템 모델에서, 색분산 패널티, 파형과 디코드된 신호의 아이 다이어그램(eye diagram)이 결과로써 보여지며, prime sequence code 수의 증가에 대해 Chirp 파라미터를 갖는 코드화된 신호의 색분산 패널티를 보인다. 이러한 접근은 pseudo-orthogonality를 가지는 비동기식 광 CDMA의 디자인에 특히 적합할 것이다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.11A
• /
• pp.1087-1094
• /
• 2008

In this paper, we propose the acquisition method of the Cyclic-Prefix CDMA using Good-Autocorrelation-Sequence (GAS-CP-CDMA) system. The sequences for GAS-CP-CDMA are m-sequence and constant amplitude zero autocorrelation code (CAZAC) with good autocorrelation property. The GAS-CP-CDMA system is proposed for interference cancellation in multi-user and -path environment in co-cell. However, the reliable initial acquisition in multi-path fading channel and multi-user system environment is crucial. In this paper, non-coherent power detector and threshold value are used for discriminating signal acquisition. The sequence used for computer simulation is CAZAC. The simulation results show proper threshold value depends on the number of users. Through the computer simulation, we draw setting up method of the optimum threshold value for the GAS-CP-CDMA system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.7A
• /
• pp.717-723
• /
• 2007

There are many weaknesses in sensor networks due to hardware limitation of sensor nodes besides the vulnerabilities of a wireless channel. In order to provide sensor networks with security, we should find out the approaches different from ones in existing wireless networks; the security mechanism in sensor network should be light-weighted and not degrade network performance. Sowe proposed a novel data origin authentication satisfying both of being light-weighted and maintaining network performance by using Unique Random Sequence Code. This scheme uses a challenge-response authentication consisting of a query code and a response code. In this paper, we show how to make a Unique Random Sequence Code and how to use it for data origin authentication.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5A
• /
• pp.402-408
• /
• 2007

There are many weaknesses in sensor networks due to hardware limitation of sensor nodes besides the vulnerabilities of a wireless channel. In order to provide sensor networks with security, we should find out the approaches different from ones in existing wireless networks; the security mechanism in sensor network should be light-weighted and not degrade network performance. Sowe proposed a novel data origin authentication satisfying both of being light-weighted and maintaining network performance by using Unique Random Sequence Code. This scheme uses a challenge-response authentication consisting of a query code and a response code. In this paper, we show how to make a Unique Random Sequence Code and how to use it for data origin authentication.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.5
• /
• pp.952-958
• /
• 1994

In this paper a method calculates the time offset between a binary sequence and its shifted sequence based on the number theoretic approach is presented. Using this method the time offset between a binary sequence and its shifted sequence can be calculated. It has been recongnized that the defining the reference (zero-offset) sequence is important in synchronous code division multiple access(CDMA) system since the same spreading sequence are used by the all base station. The time offset of the sequence with respect to the zero offset sequence are used to distinguish signal received at a mobile station from different base stations. This paper also discusses a method that defines the reference sequence.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.47 no.1
• /
• pp.35-41
• /
• 2010

In order to improve the productivity and the yield at assembling line of finished goods' manufacturers, it is necessary that the fabricated parts are supplied to the assembly line not only just in time (JIT) but also just in sequence (JIS). Parts that are not delivered just in time can cause assembly line to be delayed, and parts that are not delivered just in sequence can cause assembly line to be halted or defected products. For JIT and JIS implementation, in the paper we propose the smart pallet based just-in-sequence parts delivery system in which RFID and USN technologies are converged. Compared with the bar-code based just-in-sequence parts delivery system, the proposed system can reduce unnecessary time for confirming parts' type and sequence and unnecessary cost by bar-code labeling and sequence data' documenting. The proposed system also can overcome the drawbacks of the RFID based just-in-sequence parts delivery system such as transmission range limit and difficulties of confirming parts' type and sequence in real time. Finally, we show the implementation of the proposed system, and its practicality.

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.1109-1112
• /
• 2002

A non-coherent synchronous all-optical code-division multiple-access (CDMA) network is proposed. In this network, symmetric codes derived from prime sequence codes are used. We present the construction of symmetric codes and show that the pseudo-orthogonality of the new codes is the same as that of the original prime-sequence codes while the cardinality of the new codes is larger than that of the prime sequence codes and the modified prime codes in the same field GF(p). Therefore, an optical CDMA LAN using symmetric codes can have a larger number of potential subscribers. The new codes allow designing fully programmable serial all-optical transmitter and receiver suitable for low-loss, high-capacity, optical CDMA LANs. It is also shown that compared to systems using modified prime codes the proposed system can achieve better BER performance for low received chip optical power.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.6B
• /
• pp.569-578
• /
• 2002

This paper proposes a new multicarrier code division multiple access (CDMA) system. The proposed multicarrier CDMA system provides the advantages that the transmission bandwidth is more efficiently utilized by using divided spreading sequence, time and frequency diversity is achieved in frequency selective nultipath (acting channel, and inter-carrier interference (ICI) can be minimized by using specific data and code pattern. In this system, transmitted data bits are serial-to-parallel converted to some parallel branches. On each branch each bit is direct-sequence spread-spectrum modulated by divided spreading sequences and transmitted using orthogonal carriers. The receiver providers a Rake for each carrier, and the outputs of Rakes are combined to get time and frequency diversity. This multicarrier CDMA system allows additional flexibility in the choice of system parameters. Upon varying system parameters, bit error rate (BER) performance is examined for the proposed multicarrier CDMA system. Simulation results show that the proposed multicarrier CDMA scheme can achieve better performance than the other types of conventional multicarrier CDMA systems.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.20 no.9
• /
• pp.32-39
• /
• 2006

In this paper, an iterative subspace-based calibration algorithm for a CDMA-based antenna array in the presence of unknown gain and phase error is presented. The algorithm does not depend on the array geometry and does not require a prior knowledge of the Directions Of Arrival (DOA) of the signals. The method requires the code sequence of a reference user only. The proposed algorithm is based on the subspace method and root finding approach, and it provides estimates of the calibration vector, the DOA and the channel impulse response, by using the code sequence of a reference user. The performance of the proposed algorithm was investigated by means of computer simulations and was verified using field data measured through a custom-built W-CDMA test-bed. The data show that experimental results match well with the theoretical calibration algorithm. Also, teh study propose an efficient algorithm using the simulated annealing technique. This algorithm overcomes the requirement of initial guessing in the subspace-based approach.