• Title/Summary/Keyword: D5-CDMA

Search Result 166, Processing Time 0.025 seconds

New IT R&D 발전방안

  • Choe, Mun-Gi
    • Information and Communications Magazine
    • /
    • v.26 no.1
    • /
    • pp.25-30
    • /
    • 2009
  • IT산업은 '97년 외환위기를 기점으로 고성장을 거듭하였고, 세계 10위권 규모의 경제 강국으로 성장하는데 있어 국내 산업의 대표적인 성장동력으로서 자리 매김하였다. 하지만, 최근 성장률이 예전만 못하다는 우려의 목소리와 함께 IT가 한 단계 더 업그레이드하기 위해서는 자신의 허물을 과감히 벗는 용기가 필요하다는 것이 일반적인 시각이다. 이러한 흐름속에서 기존 IT전략과 차별화된 New IT 발전방안을 수립하게 되었다. 지금까지의 IT전략이 IT 고도화 추진을 위한 IT 중심 발전 전략이었다면, New IT전략은 IT기반 융합산업, IT융합 신산업, Next IT산업 등3대 성장축간 시너지 창출이 가능한 IT로의 수렴과 확산이 핵심이라고 할 수 있다. IT기반 융합산업의 최종 목표는 전통산업과 IT가 만나 자동차, 조선, 의료, 국방, 건설, 섬유, 기계항공 등 7개 주력기간산업의 고부가가치화 및 초일류화를 우선 실현하는 것이다. IT융합 신산업의 최종 목표는 나노(NT), 바이오(BT), 인지기술(CT) 등 비(非)IT와 교감을 통하여 IT가 에너지, 환경, 건강 등 사회적 문제를 해결하고, 녹색성장 추진의 핵심인 5대 신산업을 창출하는데 있다. 5대 신산업으로는 Green IT산업, Welfare-Infra산업, 감성조명산업, 인지단말산업, THz응용산업 등을 꼽을 수 있다. Next IT산업은 기존 14대 IT 분야를 'ETRI 비전 2020' 등 미래 청사진을 바탕으로 장기적 관점에서 재설계한 것이며, 최종 목표는 TDX, 4M D램, CDMA, 와이브로, DMB, NoLA 등 IT 강국 계보를 이어갈 4G, 미래인터넷, Smart Radio, 실감미디어, 웹3.0, 투명전자소자 등 미래 유망 핵심원천기술을 확보하고, IT 경쟁력을 강화하는 것이다.

Error Control Coding and Space-Time MMSE Multiuser Detection in DS-CDMA Systems

  • Hamouda, Walaa;McLane, Peter J.
    • Journal of Communications and Networks
    • /
    • v.5 no.3
    • /
    • pp.187-196
    • /
    • 2003
  • We consider the use of error control coding in direct sequence-code-division multiple access (OS-COMA) systems that employ multiuser detection (MUO) and space diversity. The relative performance gain between Reed-Solomon (RS) code and convolutional code (CC) is well known in [1] for the single user, additive white Gaussian noise (AWGN) channel. In this case, RS codes outperform CC's at high signal-to-noise ratios. We find that this is not the case for the multiuser interference channel mentioned above. For useful error rates, we find that soft-decision CC's to be uniformly better than RS codes when used with DS-COMA modulation in multiuser space-time channels. In our development, we use the Gaussian approximation on the interference to determine performance error bounds for systems with low number of users. Then, we check their accuracy in error rate estimation via system's simulation. These performance bounds will in turn allow us to consider a large number of users where we can estimate the gain in user-capacity due to channel coding. Lastly, the use of turbo codes is considered where it is shown that they offer a coding gain of 2.5 dB relative to soft-decision CC.

Adaptive Modulation and Coding of MIMO in Next Generation Mobile Systems (차세대 MIMO 이동통신에서 적응변조시스템의 성능분석)

  • Kang Sung-Jin;Jang Tae-Won;You Young-Whan;Whang In-Tae;Kang Min-Goo;Kang Chang-Eon
    • Journal of Internet Computing and Services
    • /
    • v.4 no.5
    • /
    • pp.1-9
    • /
    • 2003
  • In this paper, we combine AMC (Adaptive Modulation and Coding) with MIMO (Multiple Input Multiple Output) multiplexing to improve the throughput performance of AMC in Next Generation Communication Mobile Systems. In addition, we propose a system that adopts STD (Selection Transmit Diversity) in the combined system. The received SNR (Signal to Noise Ratio) is improved by adopting STD techniques and an improved SNR increases a probability of selecting MCS (Modulation and Coding Scheme) level that supports higher data rate. The computer simulation is performed in flat Rayleigh fading channel. The results show that higher throughput is achieved by AMC-TD schemes. AMC-STTD scheme shows about 250kbps increase in throughput. And AMC-STD with 2 transmit antennas achieves about 420 kbps throughput improvement over the conventional AMC at 9dB SNR.

  • PDF

A 0.31pJ/conv-step 13b 100MS/s 0.13um CMOS ADC for 3G Communication Systems (3G 통신 시스템 응용을 위한 0.31pJ/conv-step의 13비트 100MS/s 0.13um CMOS A/D 변환기)

  • Lee, Dong-Suk;Lee, Myung-Hwan;Kwon, Yi-Gi;Lee, Seung-Hoon
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.46 no.3
    • /
    • pp.75-85
    • /
    • 2009
  • This work proposes a 13b 100MS/s 0.13um CMOS ADC for 3G communication systems such as two-carrier W-CDMA applications simultaneously requiring high resolution, low power, and small size at high speed. The proposed ADC employs a four-step pipeline architecture to optimize power consumption and chip area at the target resolution and sampling rate. Area-efficient high-speed high-resolution gate-bootstrapping circuits are implemented at the sampling switches of the input SHA to maintain signal linearity over the Nyquist rate even at a 1.0V supply operation. The cascode compensation technique on a low-impedance path implemented in the two-stage amplifiers of the SHA and MDAC simultaneously achieves the required operation speed and phase margin with more reduced power consumption than the Miller compensation technique. Low-glitch dynamic latches in sub-ranging flash ADCs reduce kickback-noise referred to the differential input stage of the comparator by isolating the input stage from output nodes to improve system accuracy. The proposed low-noise current and voltage references based on triple negative T.C. circuits are employed on chip with optional off-chip reference voltages. The prototype ADC in a 0.13um 1P8M CMOS technology demonstrates the measured DNL and INL within 0.70LSB and 1.79LSB, respectively. The ADC shows a maximum SNDR of 64.5dB and a maximum SFDR of 78.0dB at 100MS/s, respectively. The ABC with an active die area of $1.22mm^2$ consumes 42.0mW at 100MS/s and a 1.2V supply, corresponding to a FOM of 0.31pJ/conv-step.

Fast OVSF Code Generation Method using Multi-Stage Spreading Scheme (다단 확산 방식을 이용한 효율적인 OVSF 코드 생성 기법)

  • Choi Chang soon;Kim Tae hoon;Kim Young lok;Joung Hwa yong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.10A
    • /
    • pp.1123-1130
    • /
    • 2004
  • This paper proposes the fast OVSF code generation method using the multi-stage spreading scheme based on the single code indexing scheme. The conventional OVSF indexing scheme based on the code-tree structure uses two numbers as the codeword indices, the layer number and the code number of the corresponding layer. However, the single code index number implicitly includes the information of the spreading factor as well as the code number. Since the binary representation of the single code indices shows the pattern of the codeword, the orthogonality between two different codewords can be determined by comparing their code indices instead of much longer codewords. The above useful property also makes the codeword can be generated directly kom its single code index. In this paper, the multi-stage spreading scheme is applied to generate the long code by spreading two shorter codewords with the appropriate code indices. The proposed fast code generation algorithm is designed for 3GPP UMTS systems and verified by the simulations.

A digital Audio Watermarking Algorithm using 2D Barcode (2차원 바코드를 이용한 오디오 워터마킹 알고리즘)

  • Bae, Kyoung-Yul
    • Journal of Intelligence and Information Systems
    • /
    • v.17 no.2
    • /
    • pp.97-107
    • /
    • 2011
  • Nowadays there are a lot of issues about copyright infringement in the Internet world because the digital content on the network can be copied and delivered easily. Indeed the copied version has same quality with the original one. So, copyright owners and content provider want a powerful solution to protect their content. The popular one of the solutions was DRM (digital rights management) that is based on encryption technology and rights control. However, DRM-free service was launched after Steve Jobs who is CEO of Apple proposed a new music service paradigm without DRM, and the DRM is disappeared at the online music market. Even though the online music service decided to not equip the DRM solution, copyright owners and content providers are still searching a solution to protect their content. A solution to replace the DRM technology is digital audio watermarking technology which can embed copyright information into the music. In this paper, the author proposed a new audio watermarking algorithm with two approaches. First, the watermark information is generated by two dimensional barcode which has error correction code. So, the information can be recovered by itself if the errors fall into the range of the error tolerance. The other one is to use chirp sequence of CDMA (code division multiple access). These make the algorithm robust to the several malicious attacks. There are many 2D barcodes. Especially, QR code which is one of the matrix barcodes can express the information and the expression is freer than that of the other matrix barcodes. QR code has the square patterns with double at the three corners and these indicate the boundary of the symbol. This feature of the QR code is proper to express the watermark information. That is, because the QR code is 2D barcodes, nonlinear code and matrix code, it can be modulated to the spread spectrum and can be used for the watermarking algorithm. The proposed algorithm assigns the different spread spectrum sequences to the individual users respectively. In the case that the assigned code sequences are orthogonal, we can identify the watermark information of the individual user from an audio content. The algorithm used the Walsh code as an orthogonal code. The watermark information is rearranged to the 1D sequence from 2D barcode and modulated by the Walsh code. The modulated watermark information is embedded into the DCT (discrete cosine transform) domain of the original audio content. For the performance evaluation, I used 3 audio samples, "Amazing Grace", "Oh! Carol" and "Take me home country roads", The attacks for the robustness test were MP3 compression, echo attack, and sub woofer boost. The MP3 compression was performed by a tool of Cool Edit Pro 2.0. The specification of MP3 was CBR(Constant Bit Rate) 128kbps, 44,100Hz, and stereo. The echo attack had the echo with initial volume 70%, decay 75%, and delay 100msec. The sub woofer boost attack was a modification attack of low frequency part in the Fourier coefficients. The test results showed the proposed algorithm is robust to the attacks. In the MP3 attack, the strength of the watermark information is not affected, and then the watermark can be detected from all of the sample audios. In the sub woofer boost attack, the watermark was detected when the strength is 0.3. Also, in the case of echo attack, the watermark can be identified if the strength is greater and equal than 0.5.