• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.6B
• /
• pp.736-745
• /
• 2001

차세대 이동통신 시스템은 고속의 멀티미디어 데이터의 신뢰성 있는 전송을 요구하고 다양한 전파환경에서 신뢰성 있는 음성, 데이터, 영상서비스 등의 다양한 서비스를 제공한다. 하지만 광대역 무선 접속을 지원하는 다중 접속 기술은 DS-CDMA(Direct Sequence Code Division Multiple Access) 시스템에서 시스템 성능을 저하시키는 심벌간 간섭(ISI) 혹은 다중접속간섭(MAI) 신호를 발생시킨다. 이러한 간섭 신호를 개선하기 위해 적응 블라인드 등화 방식을 사용하는데 적응 블라인드 등화 방식 중에서도 가장 많이 이용하는 Constant Modulus Algorithm(CMA)을 적절한 초기화 없이 사용하면 ill-convergence 현상이 나타난다. 본 논문에서는 채널의 효율을 높이기 위한 등화 방식으로 기존의 NCMA 알고리듬을 이용한 새로운 블라인드 등화 방식(Modified NCMA)을 제안하고, 이를 비동기 DS-CDMA 시스템의 다중 사용자 환경에서 컴퓨터 모의 실험 및 성능분석을 하였다. 제안한 등화 방식의 자승오차(SE : Squared Error)의 개선은 spreading gain 31과 127에 대해 cell 내의 사용자가 10명일 때 약 17dB 정도이고, 사용자가 15, 25명으로 증가시킴에 따라 자승오차의 개선은 각각 20dB, 15dB 정도로 전체 평균 자승오차는 약 17.3dB 정도로 개선됨을 확인할 수 있었다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.6
• /
• pp.22-27
• /
• 2011

This paper presents an efficient technique to reduce PN code acquisition time considerably by adjusting threshold values in direct sequence spread spectrum (DS-SS) systems. The proposed algorithm employs a pre-dump mode prior to a search mode, and the pre-dump mode determines threshold values of both search and verification modes depending on its correlation energy, which can improve not only the rejection performance of false code phases in the search mode but also that in the verification mode. The proposed method can reduce the mean code acquisition time by about 40% without increase of hardware costs compared with the conventional technique.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.5
• /
• pp.910-920
• /
• 2006

We consider the problem of estimating a code-timing of DS-CDMA signal in antenna array systems in the presence of flat fading channels and near-far environments. We derive an approximate maximum likelihood algorithm of estimating the code-timing of a desired user for DS-CDMA systems to better utilize the time-varying characteristics of the fading process. In the development of code timing estimator, the given observation bits are divided into many sets of sub-windows with each sufficiently large. The proposed method uses sub-windows with equal size associated with the coherence time of channel fading. The alternative approach is that without the estimation of the fading rate, the sufficiently given observation bits are simply separated into two consecutive sets of sub-windows. The derivation of the proposed algorithms is based on multiple antennas partially correlated in space. The impacts of spatial fading correlation on acquisition and men acquisition time performance of the proposed algorithms are also examined.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2C
• /
• pp.175-183
• /
• 2006

This letter proposes a Direct Sequence Spread Spectrum (DS-SS)-based Flight Termination System(FTS) and show the simulation results and implements the system using FRGAs. The DS-SS FTS has immunity interference signals and the influence of jamming signal. Moreover, a DS-SS FTS can provides effects on an authentication and encryption with spread codes. And the system uses more less power than an analog FM system. We used Reed-Solomon (32, 28) code and triple Data Encryption Standard(3DES) for error correction and data encryption. Also we used counter algorithm for unauthenticated device's attack The spread codes of In-phase channel and Quadrature channel were generated by Gold sequence generators. The system was implemented in Altera APEX20K100E FPGA for the ground system and EPF10K100ARC240-3 for the airborne system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.10
• /
• pp.2601-2619
• /
• 2012

A differencing multiuser detection (MUD) method is proposed for multiple-input multiple-output (MIMO) direct sequence (DS) ultra-wideband (UWB) system to cope with the multiple access interference (MAI) and the computational efficiency in Nakagami fading channel. The method, which combines a multiuser-interference-cancellation-based decision feedback equalizer using error feedback filter (MIC DFE-EFF), a coefficient optimization algorithm (COA) and a differencing algorithm (DA), is termed as MIC DFE-EFF (COA) with DA for short. In the paper, the proposed MUD method is illuminated from the rudimental MIC DFE-EFF to the advanced MIC DFE-EFF (COA) with DA step by step. Firstly, the MIC DFE-EFF system performance is analyzed by minimum mean square error criterion. Secondly, the COA is investigated for optimization of each filter coefficient. Finally, the DA is introduced to reduce the computational complexity while sacrificing little performance. Simulations show a significant performance gain can be achieved by using the MIC DFE-EFF (COA) with DA detector. The proposed MIC DFE-EFF (COA) with DA improves both bit error rate performance and computational efficiency relative to DFE, DFE-EFF, parallel interference cancellation (PIC), MIC DFE-EFF and MIC DFE-EFF with DA, though it sacrifices little system performance, compared with MIC DFE-EFF (COA) without DA.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.1 s.45
• /
• pp.57-65
• /
• 2007

In the fast block matching algorithm. search patterns of different shapes or sizes and the distribution of motion vectors have a large impact on both the searching speed and the image qualify. In this paper, we propose a new fast block matching algorithm using the flat-hexagon search pattern that ate solved disadvantages of the diamond pattern search algorithm(DS) and the hexagon-based search algorithm(HEXBS). Our proposed algorithm finds mainly the motion vectors that not close to the center of search window using the flat-hexagon search pattern. Through experiments, compared with the DS and HEXBS, the proposed f)at-hexagon search algorithm(FHS) improves about $0.4{\sim}21.3%$ in terms of average number of search point per motion vector estimation and improves about $0.009{\sim}0.531dB$ in terms of PSNR(Peak Signal to Noise Ratio).

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.5
• /
• pp.691-708
• /
• 2010

An important issue of supporting multi-users with diverse quality-of-service (QoS) requirements over wireless networks is how to optimize the systematic scheduling by intelligently utilizing the available network resource while, at the same time, to meet each communication service QoS requirement. In this work, we study the problem of a variety of communication services over multi-media heterogeneous cognitive OFDM system. We first divide the communication services into two parts. Multimedia applications such as broadband voice transmission and real-time video streaming are very delay-sensitive (DS) and need guaranteed throughput. On the other side, services like file transmission and email service are relatively delay tolerant (DT) so varying-rate transmission is acceptable. Then, we formulate the scheduling as a convex optimization problem, and propose low complexity distributed solutions by jointly considering channel assignment, bit allocation, and power allocation. Unlike prior works that do not care computational complexity. Furthermore, we propose the FAASA (Fairness Assured Adaptive Sub-carrier Allocation) algorithm for both DS and DT users, which is a dynamic sub-carrier allocation algorithm in order to maximize throughput while taking into account fairness. We provide extensive simulation results which demonstrate the effectiveness of our proposed schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.2C
• /
• pp.150-159
• /
• 2002

This paper presents the convergence time, SER(Symbol Error Rate), MSE(Mean Square Error), hardware complexity and step-size(${\mu}$) about various LMS(Least Mean Square) algorithms in FS-DFE(Fractionally Spaced-Decision Feedback Equalize) for Cable Modem based on MCNS(Multimedia Cable Network System) DOCSIS(Data Over Cable Service Interface Specification) v1.0/v1.1 standards. We designed and simulated using ${SPW}^{TM}$ and synthesized using STD90 library through ${SYNOPSYS}^{TM}$. And also, we adopted the time-multiplexed multiplication and tap shared architecture in order to achieve the low hardware complexity. Simulation results show that DS-LMS algorithms[1][3] is the optimum solution about performace and hardware size. in high order QAM applications. Finally, we achieved area saving about 58% using DS-LMS algorithm compare with conventional equalizer architecture.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.3
• /
• pp.9-18
• /
• 2009

Recently, due to the advanced technologies of mobile devices and wireless communication, there are many studies on telematics and LBS(location-based service) applications. because moving objects usually move on spatial networks, their locations are updated frequently, leading to the degradation of retrieval performance. To manage the frequent updates of moving objects' locations in an efficient way, a new distributed grid scheme, called DS-GRID (distributed S-GRID), and k-NN(k-nearest neighbor) query processing algorithm was proposed[1]. However, the result of k-NN query processing technique may be invalidated as the location of query and moving objects are changed. Therefore, it is necessary to study on continuous k-NN query processing algorithm. In this paper, we propose both MCE-CKNN and MBP(Monitoring in Border Point)-CKNN algorithmss are S-GRID. The MCE-CKNN algorithm splits a query route into sub-routes based on cell and seproves retrieval performance by processing query in parallel way by. In addition, the MBP-CKNN algorithm stores POIs from the border points of each grid cells and seproves retrieval performance by decreasing the number of accesses to the adjacent cells. Finally, it is shown from the performance analysis that our CKNN algorithms achieves 15-53% better retrieval performance than the Kolahdouzan's algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.1C
• /
• pp.19-33
• /
• 2008

A method that is adaptively selecting among previous fast motion estimation algorithms and a newly proposed fast motion estimation algorithm(UCDS) is presented in this paper. The algorithm named AUDC and a newly proposed fast motion estimation algorithms are based on the Diamond Search(DS) algorithm and Three Step Search(TSS). Although many previous fast motion estimation algorithms have lots of advantages, those have lots of disadvantages. So we thought better adaptive selection of fast motion estimation algorithms than only using one fast motion estimation algorithm. Therefore, we propose AUDC that is using length of the MV, Search Point, SAD of the neighboring block and adaptively selecting among Cross Three Step Search(CTSS), Diamond Search(DS) and Ungraded Cross Diamond Search(UCDS). Experimental results show that the AUDC is much more robust, provides a faster searching speed, and smaller distortions than other popular fast block-matching at algorithms.