• Title/Summary/Keyword: Information code

Search Result 6,033, Processing Time 0.031 seconds

Performance of PN Code Synchronization with Extended Kalman Filter for a Direct-Sequence Spread-Spectrum System (직접시퀀스 확산대역 시스템을 위한 Extended Kalman Filter 기반의 PN 부호 동기화 성능)

  • Kim, Jin-Young;Yang, Jae-Soo
    • Journal of The Institute of Information and Telecommunication Facilities Engineering
    • /
    • v.8 no.3
    • /
    • pp.107-110
    • /
    • 2009
  • In this paper, a PN code tracking loop with extended Kalman filter (EKF) is proposed for a direct-sequence spread-spectrum. EKF is used to estimate amplitude and delay in a multipath. fading channel. It is shown that tracking error performance is significantly improved by EKF compared with a conventional tracking loop.

  • PDF

Performance Improvement of UWB System using Turbo Code in Narrowband Interference Environment (협대역 간섭 환경에서 Turbo Code를 사용한 UWB 시스템의 성능 개선)

  • 강병규;이양선;강희조
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2003.05a
    • /
    • pp.578-581
    • /
    • 2003
  • UWB 시스템은 매우 넓은 주파수 대역에 걸쳐 스펙트럼이 발생하기 때문에 기존에 공존하는 협대역 시스템의 신호로부터 간섭의 영향을 받게 된다. 이는 협대역 신호가 UWB 신호 대역폭에 유입되는 부분 대역 간섭으로 고려 할 수 있다. 따라서, 본 논문에서는 협대역 간섭 모델을 대역 점유율에 따른 부분대역 간섭으로 모델링 하였으며, 협대역 간섭 점유율에 따른 TH binary PPM UWB 시스템의 성능을 분석하였다. 또한 강력한 오류 정정능력을 갖는 Turbo code를 사용함으로써 성능 개선 정도를 평가하였다.

  • PDF

THE ORPHAN STRUCTURE OF BCH(3, m) CODE

  • HWANG, GEUM-SUG
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.6 no.1
    • /
    • pp.109-119
    • /
    • 2002
  • If C is a code, an orphan is a coset without any parent. We investigate the structure of orphans of the code BCH(3, m). All weight 5 cosets and all weight 3 reduced cosets are orphans, and all weight 1,2 and 4 are not orphans. We conjecture that all weight 3 unreduced cosets are not orphans. We prove this conjecture for m = 4, 5.

  • PDF

Low Latency Algorithms for Iterative Codes

  • Choi, Seok-Soon;Jung, Ji-Won;Bae, Jong-Tae;Kim, Min-Hyuk;Choi, Eun-A
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.3C
    • /
    • pp.205-215
    • /
    • 2007
  • This paper presents low latency and/or computation algorithms of iterative codes of turbo codes, turbo product codes and low density parity check codes for use in wireless broadband communication systems. Due to high coding complexity of iterative codes, this paper focus on lower complexity and/or latency algorithms that are easily implementable in hardware and further accelerate the decoding speed.

Designation of International Network by using Building ID Code (건물ID코드를 이용한 국제망의 표현방법 연구)

  • 이효영;노정자이범교
    • Proceedings of the IEEK Conference
    • /
    • 1998.06a
    • /
    • pp.118-121
    • /
    • 1998
  • Standardized representations and data codes are crucial for the exchange of information between systems, organizations, and people in the telecommunications operations area. ITU-T M.1400 recommends a unified representation for the international network routes which includes such location data elements as Town A, Suffix Code which was designed for the representation of domestic network locations to meet the ITU-T recommendation. This paper suggests an expanded building ID code for the representation of the international network locations.

  • PDF

A Study on the Performance of FH/FSK Including Jammer and Code Correlation Effects (Jammer와 부호 상관 효과를 고려한 FH/FSK성능 분석에 관한 연구)

  • 안중수;박진수
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.16 no.5
    • /
    • pp.424-433
    • /
    • 1991
  • In the noncoherent FH/FSK system presence of the multitione jamming and noise, in the case random and 송 structures jamming model, the performance analyzed that random and struetured jamming derived error proability. It is found that error probability and performance when error corecting code used Hamming. BCH, Convolutional code under the worst case partial band jamming interference.

  • PDF

A Study on codeword's nonfull-Rank in Space-Time Block Code (Space-Time Block Code에서의 코드워드(codeword)가 완전계수(Full-Rank)가 아닌 경우에 관한 연구)

  • Lee, Eun-Hee;Kim, Jong-Seong;Choi, Beng-Tae
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2002.11b
    • /
    • pp.1575-1578
    • /
    • 2002
  • 본 논문에서는 공간-시간 블록 부호디자인(Space-Time Block Code) 관점에서 직교-디자인(Orthogonal-design) 즉, 최소거리가 5이면서 완전-계수(Full-Rank)인 디자인을 비교대상으로 완전-계수(Full-Rank)가 아니면서 최소거리가 5와7인 두 부호에 관하여 연구되어졌다.

  • PDF

A Function Network Analyzer for Efficient Analysis of Automotive Operating System

  • Yu, Lu Zheng;Choi, Yunja
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2013.05a
    • /
    • pp.972-975
    • /
    • 2013
  • This work developed a code analysis & extraction tool named Function Network Analyzer (FNA) to reduce the cost of software safety analysis. FNA analyzes functions and variables which a given function depends on, and extracts subset of code that can be compiled of automotive operating system, final resulting a well-ordered code sequence that can be compiled for model checking technique. And the experimental result illustrates that FNA can get 100% accurate rate and over 96% reduction rate by testing API functions from trampoline system.

Low Complexity Maximum-likelihood Decoder for VBLAST-STBC scheme using non-square O-STBC code rate $\frac{3}{4}$

  • Pham Van-Su;Le Minh-Tuan;Mai Linh;Yoon Gi-Wan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2006.05a
    • /
    • pp.107-110
    • /
    • 2006
  • This work presents a low complexity maximum-likelihood decoder for signal detection in VBLAST-STBC system, which employs non-square O-STBC code rate 3/4. By stacking received symbols from different received symbolduration and applying QR decomposition resulting the special format of upper triangular matrix R, the proposed decoder is able to provide not only ML-like BER performance but also very low computational load. The low computational load and ML-like BER performance properties of the proposed decoder are verified by computer simulations.

  • PDF

A Multiple-Disseminators Determining Mechanism for Fast Code Dissemination in Wireless Sensor Networks (무선 센서 네트워크에서 빠른 코드분배를 위한 다수분배자 선정 방법)

  • Kim, Mi-Hui;Hong, June-S.
    • Journal of Information Technology Services
    • /
    • v.10 no.2
    • /
    • pp.247-257
    • /
    • 2011
  • In this paper, we propose a multiple-disseminators determining mechanism for Efficient Code Dissemination with low-delay(ECoDi) for wireless sensor networks (WSN). Code dissemination is in the spotlight as an important research issue since sensor nodes are necessary for updating new software remotely or fixing bugs dynamically. In particular, the time factor for code dissemination is the most important factor in order that the normal operation of nodes can be continuously performed as soon as finishing the dissemination. For this factor, ECoDi determines the set of disseminators through regression analysis based on the size of distributed code and the time of past unicasts and broadcasts. Then it transmits the entire code as a unicast to multiple disseminators, and the disseminators broadcast the code to the remaining neighbor nodes. Performance results on a testbed show that ECoDi reduces dissemination time significantly compared to a conventional scheme.