• Title/Summary/Keyword: Error Detection Code

Search Result 189, Processing Time 0.028 seconds

Turbo Trellis Coded Modulation with Multiple Symbol Detection (다중심벌 검파를 사용한 터보 트렐리스 부호화 변조)

  • Kim Chong Il
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.1 no.2
    • /
    • pp.105-114
    • /
    • 2000
  • In this paper, we propose a bandwidth-efficient channel coding scheme using the turbo trellis-coded modulation with multiple symbol detection. The turbo code can achieve good bit error rates (BER) at low SNR. That comprises two binary component codes and an interleaver. TCM codes combine modulation and coding by optimizing the euclidean distance between codewords. This can be decoded with the Viterbi or the symbol-by- symbol MAP algorithm. But we present the MAP algorithm with branch metrics of the Euclidean distance of the first phase difference as well as the Lth phase difference. The study shows that the turbo trellis-coded modulation with multiple symbol detection can improve the BER performance at the same SNR.

  • PDF

A Study on Eyelid and Eyelash Localization for Iris Recognition (홍채 인식에서의 눈꺼풀 및 눈썹 추출 연구)

  • Kang, Byung-Joon;Park, Kang-Ryoung
    • Journal of Korea Multimedia Society
    • /
    • v.8 no.7
    • /
    • pp.898-905
    • /
    • 2005
  • Iris recognition Is that identifies a user based on the unique iris muscle patterns which has the functionalities of dilating or contracting pupil region. Because it is reported that iris recognition is more accurate than other biometries such as face, fingerprint, vein and speaker recognition, iris recognition is widely used in the high security application domain. However, if unnecessary information such as eyelid and eyelash is included in iris region, the error for iris recognition is increased, consequently. In detail, if iris region is used to generate iris code including eyelash and eyelid, the iris codes are also changed and the error rate is increased. To overcome such problem, we propose the method of detecting eyelid by using pyramid searching parabolic deformable template. In addition, we detect the eyelash by using the eyelash mask. Experimental results show that EER(Equal Error Rate) for iris recognition using the proposed algorithm is lessened as much as $0.3\%$ compared to that not using it.

  • PDF

Low-Cost CRC Scheme by Using DBI(Data Bus Inversion) for High Speed Semiconductor Memory (고속반도체 메모리를 위한 DBI(Data Bus Inversion)를 이용한 저비용 CRC(Cyclic Redundancy Check)방식)

  • Lee, Joong-Ho
    • Journal of IKEEE
    • /
    • v.19 no.3
    • /
    • pp.288-294
    • /
    • 2015
  • CRC function has been built into the high-speed semiconductor memory device in order to increase the reliability of data for high-speed operation. Also, DBI function is adopted to improve of data transmission speed. Conventional CRC(ATM-8 HEC code) method has a significant amounts of area-overhead(~XOR 700 gates), and processing time(6 stage XOR) is large. Therefore it leads to a considerable burden on the timing margin at the time of reading and writing of the low power memory devices for CRC calculations. In this paper, we propose a CRC method for low cost and high speed memory, which was improved 92% for area-overhead. For low-cost implementation of the CRC scheme by the DBI function it was supplemented by data bit error detection rate. And analyzing the error detection rate were compared with conventional CRC method.

A Study on Transport Robot for Autonomous Driving to a Destination Based on QR Code in an Indoor Environment (실내 환경에서 QR 코드 기반 목적지 자율주행을 위한 운반 로봇에 관한 연구)

  • Se-Jun Park
    • Journal of Platform Technology
    • /
    • v.11 no.2
    • /
    • pp.26-38
    • /
    • 2023
  • This paper is a study on a transport robot capable of autonomously driving to a destination using a QR code in an indoor environment. The transport robot was designed and manufactured by attaching a lidar sensor so that the robot can maintain a certain distance during movement by detecting the distance between the camera for recognizing the QR code and the left and right walls. For the location information of the delivery robot, the QR code image was enlarged with Lanczos resampling interpolation, then binarized with Otsu Algorithm, and detection and analysis were performed using the Zbar library. The QR code recognition experiment was performed while changing the size of the QR code and the traveling speed of the transport robot while the camera position of the transport robot and the height of the QR code were fixed at 192cm. When the QR code size was 9cm × 9cm The recognition rate was 99.7% and almost 100% when the traveling speed of the transport robot was less than about 0.5m/s. Based on the QR code recognition rate, an experiment was conducted on the case where the destination is only going straight and the destination is going straight and turning in the absence of obstacles for autonomous driving to the destination. When the destination was only going straight, it was possible to reach the destination quickly because there was little need for position correction. However, when the destination included a turn, the time to arrive at the destination was relatively delayed due to the need for position correction. As a result of the experiment, it was found that the delivery robot arrived at the destination relatively accurately, although a slight positional error occurred while driving, and the applicability of the QR code-based destination self-driving delivery robot was confirmed.

  • PDF

List Sphere Decoding using error location information of RS code (RS Code의 오류 위치 정보를 이용하는 리스트 구 복호기)

  • Park, Sun-Ho;Lee, Hyuk;Shim, Byong-Hyo
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2010.07a
    • /
    • pp.53-56
    • /
    • 2010
  • 본 논문은 Shannon의 정리에 따른 채널 용량에 근접한 성능을 보이는 것으로 알려진 터보 복호기 기반의 반복적인 검출과 복호화(Iterative Detection and Decoding) 기법에서 반복적인 복호화를 수행할 시에 제외되었던 리스트 구 복호기(List Sphere Decoder)에서 사전 정보(prior information)을 이용할 수 있도록 하여 수정된 IDD 기법을 제안하였다. 기존의 기법에서는 사후확률(A posteriori probability)을 계산하기 위하여 리스트 구 복호기를 사용하였으나 반복적인 복호화 수행 시에는 사전 정보를 이용하지 않는 특성으로 인하여 제외된다. 만약 잡음(noise) 등의 이유로 검출된 심볼 벡터 목록이 원래의 것과 매우 다른 경우라도 재 검출을 하지 않기 때문에 반복적인 복호화를 수행하더라도 원래의 정보에 근접하기 어렵게 된다. 본 논문에서는 이러한 기존의 기법에서 리스트 구 복호기를 터보 복호기의 Log Likelihood Ratio (LLR) 값을 사전 정보로 이용할 수 있도록 수정된 리스트 구 복호기를 제안하였다. 수정된 리스트 복호기는 반복적인 복호화를 수행 시 이전의 복호화에서 얻은 정보를 이용하여 새로이 검출된 심볼 벡터 목록을 제공하게 된다. 실제의 통신환경과 유사한 모델의 실험을 통해 수정된 IDD 기법이 기존의 IDD로 구성되는 내부 피드백에 RS 복호기 기반의 외부 피드백으로 구성된 형태로 피드백 회수가 증가할수록 기존의 IDD에 비해 성능이 개선됨을 확인하였다.

  • PDF

Delay-Throughput Analysis Based on Cross-Layer Concept for Optical CDMA Systems (Cross-layer 개념을 바탕으로 한 광 CDMA 시스템을 위한 Delay-Throughput 분석)

  • Kim, Yoon-Hyun;Kim, Seung-Jong;O, Yeong-Cheol;Lee, Seong-Chun;Kim, Jin-Young
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2009.08a
    • /
    • pp.314-319
    • /
    • 2009
  • In this paper, the network performance of a turbo coded optical code division multiple access (COMA) system with cross-layer, which is between physical and network layers, concept is analyzed and simulated We consider physical and MAC layers in a cross-layer concept. An intensity-modulated/direct-detection (IM/DD) optical system employing pulse position modulation (PPM) is considered In order to increase the system performance, turbo codes composed of parallel concatenated convolutional codes (PCCCs) is utilized. The network performance is evaluated in terms of bit error probability (BEP). From the simulation results, it is demonstrated that turbo coding offers considerable coding gain with reasonable encoding and decoding complexity. Also, it is confirmed that the performance of such an optical COMA network can be substantially improved by increasing the interleaver length and the number of iterations in the decoding process. The results of this paper can be applied to implement the indoor optical wireless LANs.

  • PDF

Improvement and Evaluation of Automatic Quality Check Algorithm for Particulate Matter (PM10) by Analysis of Instrument Status Code (부유분진(PM10) 측정기 상태 코드 분석을 통한 자동 품질검사 알고리즘 개선 및 평가)

  • Kim, Mi-Gyeong;Park, Young-San;Ryoo, Sang-Boom;Cho, Jeong Hoon
    • Atmosphere
    • /
    • v.29 no.4
    • /
    • pp.501-509
    • /
    • 2019
  • Asian Dust is a meteorological phenomenon that sand particles are raised from the arid and semi-arid regions-Taklamakan Desert, Gobi Desert and Inner Mongolia in China-and transported by westerlies and deposited on the surface. Asian dust results in a negative effect on human health as well as environmental, social and economic aspects. For monitoring of Asian Dust, Korea Meteorological Administration operates 29 stations using a continuous ambient particulate monitor. Kim et al. (2016) developed an automatic quality check (AQC) algorithm for objective and systematic quality check of observed PM10 concentration and evaluated AQC with results of a manual quality check (MQC). The results showed the AQC algorithm could detect abnormal observations efficiently but it also presented a large number of false alarms which result from valid error check. To complement the deficiency of AQC and to develop an AQC system which can be applied in real-time, AQC has been modulated. Based on the analysis of instrument status codes, valid error check process was revised and 6 status codes were further considered as normal. Also, time continuity check and spike check were modified so that posterior data was not referred at inspection time. Two-year observed PM10 concentration data and corresponding MQC results were used to evaluate the modulated AQC compared to the original AQC algorithm. The results showed a false alarm ratio decreased from 0.44 to 0.09 and the accuracy and the probability of detection were conserved well in spite of the exclusion of posterior data at inspection time.

Efficient Detection Scheme for Turbo Coded QO-STBC Schemes (터보 부호와 결합된 준직교 시공간 블록 부호의 효율적인 검출 기법)

  • Park, Un-Hee;Oh, Dae-Sub;Kim, Young-Min;Kim, Soo-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.5A
    • /
    • pp.423-430
    • /
    • 2010
  • The performances of turbo-coded space-time block coding (STBC) schemes are subject to how soft decision detection (SDD) information are generated from the STBC decoder. For this reason, we have to pay particular attention to estimation of SDD. In this paper, we evaluate the performance of a turbo coded STBC scheme depending on the accuracy of the SDD. Recently, a new quasi orthogonal STBC (QO-STBC) scheme using a noise whitened filter was proposed in order to reduce noise enhancing effect of zero forcing detection process. This QO-STBC scheme was proven to be efficient in computational complexity compared to the other conventional QO-STBC schemes. In this paper, we first present detailed mathematical analysis on the noise whitened QO-STBC scheme, and by using the result we propose the optimum SDD method.

A Study on the Improved Parity Check Receiver for the Extended m-sequence Based Multi-code Spread Spectrum System with Code Set Partitioning and Constant Amplitude Precoding (코드집합 분할 방식의 확장 m-시퀀스 기반 정진폭 멀티코드 대역확산 통신 시스템을 위한 개선된 패리티 검사 기반 수신기에 관한 연구)

  • Han, Jun-Sang;Kim, Dong-Joo;Kim, Myoung-Jin
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.49 no.8
    • /
    • pp.1-11
    • /
    • 2012
  • The multi-code spread spectrum communication system, which spreads data bit stream by multiplexing orthogonal codes, can transmit data in high rate. However it needs the high-cost good linear amplifier because of the multi-level output signal. In order to overcome this drawback several systems making the amplitude of output signal constant with Walsh codes have been proposed. Recently constant amplitude pre-coded multi-code spread spectrum systems using extended m-sequence have been proposed. In this paper we consider an extended m-sequence based constant amplitude multi-code spread spectrum system with code set partitioning. By grouping the orthogonal codes into 4 subsets, not only is the computational complexity of the transceiver reduced but BER performance also improves. It has been shown that parity checking on four detected codes at the receiver can correct code detection error and result in BER performance enhancement. In this paper we propose a improved parity check receiver. We carried out computer simulation to verify feasibility of the proposed algorithm.

A Study of Ordering Sphere Decoder Class for Space-Time Codes

  • Pham, Van-Su;Mai, Linh;Kabir, S.M. Humayun;Yoon, Gi-Wan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.05a
    • /
    • pp.567-571
    • /
    • 2008
  • In this paper, an overview on the ordering sphere decoder (SD) class for space-time codes (STC) will be presented. In SDs, the ordering techniques are considered as promising methods for reducing complexity by exploiting a sorted list of candidates, thus decreasing the number of tested points. First, we will present the current state of art of SD with their advantages and disadvantages. Then, the overview of simply geometrical approaches for ordering is presented to address the question to overcome the disadvantages. The computer simulation results shown that, thanks to the aid of ordering, the ordering SDs can achieve optimal bit-error-rate (BER) performance while requiring the very low complexity, which is comparable to that of linear sub-optimal decoders.

  • PDF