• 제목/요약/키워드: Multiple error correction

검색결과 114건 처리시간 0.035초

Correction of Time and Coordinate Systems for Interoperability of Multi-GNSS

  • Kim, Lawoo;Lee, Yu Dam;Lee, Hyung Keun
    • Journal of Positioning, Navigation, and Timing
    • /
    • 제10권4호
    • /
    • pp.279-289
    • /
    • 2021
  • GNSS receivers capable of tracking multiple Global Navigation Systems (GNSSs) simultaneously are widely used. In order to estimate accurate user position and velocity, it is necessary to consider the key elements that contribute to the interoperability of the different GNSSs. Typical examples are the time system and the coordinate system. Each GNSS is operated based on its own reference time system depending on when the system was developed and whether the leap seconds are applied. In addition, each GNSS is designed based on its own coordinate system based on earth model constant values. This paper addresses the interoperability issues from the viewpoint of Single Point Positioning (SPP) users utilizing multiple GNSS signals from GPS, GLONASS, BeiDou, and Galileo. Since the broadcast ephemerides of each GNSS are based on their own time and coordinate systems, the time and the coordinate systems should be unified for any user algorithm. For this purpose, this paper proposes a method of converting each GNSS coordinate system into the reference coordinate system through Helmert transformation. The error of the broadcast ephemerides was calculated with the precise ephemerides provided by the International GNSS Service (IGS). The effectiveness of the proposed multi-GNSS correction and transformation method is verified using the Multi-GNSS Experiment (MGEX) station data.

소프트 값을 이용한 해밍 부호의 개선된 복호 방식 (An Improved Decoding Scheme of Hamming Codes using Soft Values)

  • 정호영
    • 한국정보전자통신기술학회논문지
    • /
    • 제12권1호
    • /
    • pp.37-42
    • /
    • 2019
  • 본 논문에서는 부호 길이 내에서 1개의 오류를 정정할 수 있는 해밍 부호(Hamming code)에 대해 2 개의 오류를 정정할 수 있는 신드롬 복호 기법을 제안하였다. 본 논문에서 제안한 복호 기법은 복호 복잡도를 거의 증가시키지 않으면서도 다중 오류를 정정함으로서 복호 복잡도 대비 오율 성능을 크게 개선할 수 있는 장점을 갖는다. 본 논문에서 제안한 복호 기법은 IoT 기기들 간의 통신이나 분자 통신과 같이 부/복호기에서 에너지의 사용이 극히 제한된 환경에서 부 복호기의 에너지 사용이 적으면서도 우수한 오율 성능이 요구되는 경우에 적합하다. 본 논문에서 제안한 복호 기법이 적용된 해밍 부호의 오율 성능이 개선되었음을 보이기 위해 BPSK 변조 방식과 AWGN 채널 환경에서 부호 길이가 짧은 다수의 해밍 부호에 대해 시뮬레이션을 수행하였으며, 수행 결과 해밍 부호의 부호 길이에 무관하게 제안한 복호 방식은 기존 복호 방식에 비해 약 1.1[dB] ~ 1.2[dB] 정도의 성능 개선을 확인할 수 있었다.

Communications Protocol Used in the Wireless Token Rings for Bird-to-Bird

  • Nakajima, Isao;Juzoji, Hiroshi;Ozaki, Kiyoaki;Nakamura, Noboru
    • Journal of Multimedia Information System
    • /
    • 제5권3호
    • /
    • pp.163-170
    • /
    • 2018
  • We developed a multicast communication packet radio protocol using a time-sharing tablet system ("wireless token ring") to achieve the efficient exchange of files among packet radio terminals attached to swans. This paper provides an overview of the system and the protocol of the packet communications. The packet device forming the main part of the transceiver developed is the Texas Instruments CC2500. This device consists of one call-up channel and one data transmission channel and could improve error frame correction using FEC (forward error correction) with 34.8 kbps MSK and receiving power of at least -64 dBm (output 1 dBm at distance of 200 m using 3 dBi antenna). A time-sharing framework was determined for the wireless token ring using call sign ordinals to prevent transmission right loss. Tests using eight stations showed that resend requests with the ARQ (automatic repeat request) system are more frequent for a receiving power supply of -62 dBm or less. A wireless token ring system with fixed transmission times is more effective. This communication protocol is useful in cases in which frequency resources are limited; the energy consumed is not dependent on the transmission environment (preset transmission times); multiple terminals are concentrated in a small area; and information (position data and vital data) is shared among terminals under circumstances in which direct communication between a terminal and the center is not possible. The method allows epidemiological predictions of avian influenza infection routes based on vital data and relationships among individual birds based on the network topology recorded by individual terminals. This communication protocol is also expected to have applications in the formation of multiple in vivo micromachines or terminals that are inserted into living organisms.

스튜어트 플랫폼의 견실한 순기구학 추정기 설계 (Robust estimator design for the forward kinematics solution of stewart platform)

  • 강지윤;김동환;이교일
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
    • /
    • pp.28-31
    • /
    • 1996
  • We propose an estimator design method of Stewart platform, which gives the 6DOF, positions and velcities of Stewart platform from the measured cylinder length. The solution of forward kinematics is not solved yet as a useful realtime application tool because of the complexity of the equation with multiple solutions. Hence we suggest an nonlinear estimator for the forward kinematics solution using Luenberger observer with nonlinear error correction term. But the way of residual gain selection of the estimator is not clear, so we suggest an algebraic Riccati equation for gain matrix using Lyapunov method. This algorithm gives the sufficient condition of the stability of error dynamics and can be extended to general nonlinear system.

  • PDF

Spurious NAK Suppression 알고리즘을 통한 RLP 성능향상 (RLP Performance Improvement by Spurious NAK Suppression algorithm)

  • 이상호
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 한국정보통신설비학회 2008년도 정보통신설비 학술대회
    • /
    • pp.486-490
    • /
    • 2008
  • 본 논문에서는 Spurious NAK Suppression알고리즘을 통하여 RLP의 성능향상에 대한 기법을 제안한다. 일반적으로, Hybrid ARQ기법에서는 MAC과 Physical Layer에서의 Retransmission 및 Error Correction으로 무선환경에서의 Error를 줄이고 latency를 보장하고 있다. 그러나 Hybrid ARQ에서의 Multiple SAW나 Selective-ARQ에 의해서 인접한 Packet들 간의 out-of-sequence문제가 발생할 수 밖에 없으며, upper layer인 RLP(혹은 RLC)에서는 이를 re-sequencing하여야 하는 부담감이 생기게 된다. 본 논문에서는 RLP receiver에서의 re-sequencing방법에 있어서, 효율적으로 RLP-NAK의 전송시점을 결정하는 NAK suppression 방법을 제안하고 있으며, 실험을 통하여 높은 성능향상을 보임을 확인할 수 있다.

  • PDF

부호화한 주파수 도약 대역 확산 통신 네트워크의 성능 분석 (Performance Analysis of Coded FH/SSMA Communication Network system)

  • 김근묵;정영지;홍은기;황금찬
    • 한국통신학회논문지
    • /
    • 제17권7호
    • /
    • pp.730-738
    • /
    • 1992
  • 본 논문에서는 AWGN, 협대역재밍, 페이딩, 사용자간간섭이 혼재하는 채널에서 FH/SSMA시스템의 성능을 분석하였다. 다수의 사용자가 존재할 때 나타나는 주파수총돌(사용자간 간섭)을 고려하면서,채널의 보조정보를 이용할 경우와 이용하지 않을 경우를 구분하여 부호별 에러확률과 처리능력을 계산하였다. 분석 결과, 복합적인 간섭이 혼재하는 채널환경에서 RS부호가 길쌈부호보다 우수하며, 쇄상 부호는 같은 부호화율인 RS부호와 거의 동일한 성는을 나타냈다. 페이딩이나 협대역재민등 복합적인 간섭이 존재하는 채널환경에서는 에러정정용 부호로서 RS 부호가 최적인 것으로 나타났다.

  • PDF

패킷부분재전송기법의 수율 최저 한계 (Lower Bound of Partial Packet Recovery)

  • 정충교
    • 산업기술연구
    • /
    • 제28권A호
    • /
    • pp.113-117
    • /
    • 2008
  • Wireless carrier sense multiple access (CSMA) systems are widely used but show extremely different transmission efficiency according to the operation environment. Simulation or prototype deployment is needed to see the transmission efficiency of a wireless CSMA system with the partial packet retransmission scheme. The lower bound for the transmission efficiency of such a system is found mathematically in this work. This shows how much the partial packet retransmission scheme improves the transmission efficiency quantitatively. It also shows that the maximum throughput is obtained at higher offered load compared to the conventional CSMA system without the partial packet transmission. The result of this work can be applied to IEEE 802.11 networks or wireless mesh networks.

  • PDF

On Development of Lower Order Aggregated Model for the Linear Large-Scale Model

  • 유병우
    • 경영과학
    • /
    • 제15권2호
    • /
    • pp.125-142
    • /
    • 1998
  • The aggregation on linear large-scale dynamic systems is examined in this paper and a "two-step" approach is proposed. In this procedure, the aggregated system consists of two subsystems. The first subsystem represents aggregation through the retainment of dominant eigenvalues of the original system, leading to a first approximation of the desired output of the original system. The purpose of augmenting it with a second subsystem is to provide an estimation of the error on the first approximation, thus permitting a second correction to the output approximation and resulting in an output approximation of greater accuracy. Optimization techniques are discussed for the determination of unknown parameters in the aggregated system. These techniques use minimization principles of certain suitable performance indices and are developed for both single input-single output and multiple input-multiple output system. Numerical examples illustrating these procedures are given and the results are compared with those obtained using existing methods. Finally, a pharmacokinetics problem is studied from the aggregation point of view.

  • PDF

Design and Simulation of Two-Dimensional OCDMA En/Decoder Composed of Double Ring Add/Drop Filters and Delay Waveguides

  • Chung, Youngchul
    • Journal of the Optical Society of Korea
    • /
    • 제20권2호
    • /
    • pp.257-262
    • /
    • 2016
  • A two-dimensional optical code division multiple access (OCDMA) en/decoder composed of four double-ring resonator add/drop filters and three delay waveguides is designed, and a transfer matrix method combined with fast Fourier transform is implemented to provide numerical simulations for the en/decoder. The auto-correlation peak level over the maximum cross-correlation level is larger than 3 at the center of the correctly decoded pulse for most of wavelength hopping and spectral phase code combinations, which assures the BER lower than 10-3 which corresponds to the forward error correction limit.

Redundancy Minimizing Techniques for Robust Transmission in Wireless Networks

  • Kacewicz, Anna;Wicker, Stephen B.
    • Journal of Communications and Networks
    • /
    • 제11권6호
    • /
    • pp.564-573
    • /
    • 2009
  • In this paper, we consider a wireless multiple path network in which a transmitting node would like to send a message to the receiving node with a certain probability of success. These two nodes are separated by N erasure paths, and we devise two algorithms to determine minimum redundancy and optimal symbol allocation for this setup. We discuss the case with N = 3 and then extend the case to an arbitrary number of paths. One of the algorithms minimum redundancy algorithm in exponential time is shown to be optimal in several cases, but has exponential running time. The other algorithm, minimum redundancy algorithm in polynomial time, is sub-optimal but has polynomial worstcase running time. These algorithms are based off the theory of maximum-distance separable codes. We apply the MRAET algorithm on maximum-distance separable, Luby transform, and Raptor codes and compare their performance.