• Title/Summary/Keyword: Bit errors

Search Result 314, Processing Time 0.023 seconds

Design error corrector of binary data in holographic dnta storage system using fuzzy rules (근접 픽셀 에러 감소를 위한 홀로그래픽 데이터 스토리지 시스템의 퍼지 규칙 생성)

  • Kim Jang-hyun;Kim Sang-hoon;Yang Hyun-seok;Park Jin-bae;Park Young-Pil
    • 정보저장시스템학회:학술대회논문집
    • /
    • 2005.10a
    • /
    • pp.129-133
    • /
    • 2005
  • Data storage related with writing and retrieving requires high storage capacity, fast transfer rate and less access time. Today any data storage system cannot satisfy these conditions, however holographic data storage system can perform faster data transfer rate because it is a page oriented memory system using volume hologram in writing and retrieving data. System can be constructed without mechanical actuating part therefore fast data transfer rate and high storage capacity about $1Tb/cm^3$ can be realized. In this paper, to reduce errors of binary data stored in holographic data storage system, a new method for bit error reduction is suggested. First, find cluster centers using subtractive clustering algorithm then reduce intensities of pixels around cluster centers and fuzzy rules. Therefore, By using this error reduction method following results are obtained ; the effect of Inter Pixel Interference noise is decreased and the intensity profile of data page becomes uniform therefore the better data storage system can be constructed.

  • PDF

Robust TCP algorithm against the burst error in wireless Internet (버스트 에러에 강인한 TCP 알고리즘)

  • 박종훈;배세인;유명식
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.6B
    • /
    • pp.548-553
    • /
    • 2004
  • Due to the recent advance in wireless communication technology, it is now more demanding to enjoy the high quality of service in the wireless Internal. TCP, which many Internet applications depend on for the end-to-end transport service, is optimized for the wired environment. Consequently, TCP suffers from severe performance degradation in the wireless environment where the bit error rate is relatively high and the burst errors frequently take place. In this paper, we propose a Robust TCP algorithm, which can effectively react against the burst error and significantly improve the TCP performance in wireless Internet. It is shown through the simulations that the Robust TCP performs well in the wireless environment, especially under the burst error condition.

An Efficient Fading Estimation and Compensation Techniques for Transmission of Trellis Coded 16 QAM in Wireless Communication Channel (무선통신채널에서 트렐리스 부호화한 16 QAM 신호전송을 위한 효율적인 페이딩 추정.보상방안)

  • 김순영;김정수;이광재;이문호
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.10 no.6
    • /
    • pp.855-865
    • /
    • 1999
  • This paper presents the improvement of BER performance using fading compensation method for 16 QAM-TCM to reduce the effects of multi-path fading in mobile radio environments. We propose the multi-pilot symbol aided fading compensation technique using Gausian interpolation method for inter-symbol interference or fading distortion occured in frequency selective fading channel. The proposed system is combined coding and modulation scheme for improving the reliability of a digital transmission system without increasing the transmitted power or the required bandwidth. In the fading compensation, the pilot symbols from a known sequence is multiplexed into the data symbols at regular intervals to from a frames for transmission. And we use a modified bit reversal block interleaver to randomize burst errors. The results show that significant improvements in the bit-error rate performances can be achieved by the proposed techniques.

  • PDF

Motion Estimation for Transcoding Using Intermediate data on the Compressed Video (압축 비디오에서 중간정보를 이용한 트랜스 부호화의 움직임 추정)

  • 구성조;김강욱;김종훈;황찬식
    • Proceedings of the Korea Society for Industrial Systems Conference
    • /
    • 2001.05a
    • /
    • pp.288-299
    • /
    • 2001
  • In transcoding, simply reusing the motion vectors extracted from an incoming video bit stream may not result in the best quality because the incoming motion vectors become non-optimal due to the reconstruction errors. To achieve the best video quality possible, a new motion estimation should be performed in the transcoder. An adaptive motion vector refinement is proposed that refines the base motion vector according to the activity of macroblock using intermediate data extracted from an incoming video bit stream. Experimental results shows that the proposed method can improve the video quality to the level achieved by using the full-scale motion estimation with minimal computational complexity.

  • PDF

Error Concealment Based on Multiple Representation for Wireless Transmission of JPEG2000 Image

  • Ou, Yang;Lee, Won-Young;Yang, Tae-Uk;Chee, Sung-Taek;Rhee, Kyung-Hyune
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.1C
    • /
    • pp.68-78
    • /
    • 2008
  • The transmission of multimedia information over error-prone channels such as wireless networks has become an important area of research. In this paper, we propose two Error Concealment(EC) schemes for wireless transmission of JPEG2000 image. The Multiple Representation(MR) is employed as the preprocessing in our schemes, whereas the main error concealing operation is applied in wavelet domain at receiver side. The compressed code-stream of several subsampled versions of original image is transmitted over a single channel with random bit errors. In the decoder side, the correctly reconstructed wavelet coefficients are utilized to recover the corrupted coefficients in other sub-images. The recovery is carried out by proposed basic(MREC-BS) or enhanced(MREC-ES) methods, both of which can be simply implemented. Moreover, there is no iterative processing during error concealing, which results a big time saving. Also, the simulation results confirm the effectiveness and efficiency of our proposed schemes.

CMOS true-time delay IC for wideband phased-array antenna

  • Kim, Jinhyun;Park, Jeongsoo;Kim, Jeong-Geun
    • ETRI Journal
    • /
    • v.40 no.6
    • /
    • pp.693-698
    • /
    • 2018
  • This paper presents a true-time delay (TTD) using a commercial $0.13-{\mu}m$ CMOS process for wideband phased-array antennas without the beam squint. The proposed TTD consists of four wideband distributed gain amplifiers (WDGAs), a 7-bit TTD circuit, and a 6-bit digital step attenuator (DSA) circuit. The T-type attenuator with a low-pass filter and the WDGAs are implemented for a low insertion loss error between the reference and time-delay states, and has a flat gain performance. The overall gain and return losses are >7 dB and >10 dB, respectively, at 2 GHz-18 GHz. The maximum time delay of 198 ps with a 1.56-ps step and the maximum attenuation of 31.5 dB with a 0.5-dB step are achieved at 2 GHz-18 GHz. The RMS time-delay and amplitude errors are <3 ps and <1 dB, respectively, at 2 GHz-18 GHz. An output P1 dB of <-0.5 dBm is achieved at 2 GHz-18 GHz. The chip size is $3.3{\times}1.6mm^2$, including pads, and the DC power consumption is 370 mW for a 3.3-V supply voltage.

Implementation and characterization of flash-based hardware security primitives for cryptographic key generation

  • Mi-Kyung Oh;Sangjae Lee;Yousung Kang;Dooho Choi
    • ETRI Journal
    • /
    • v.45 no.2
    • /
    • pp.346-357
    • /
    • 2023
  • Hardware security primitives, also known as physical unclonable functions (PUFs), perform innovative roles to extract the randomness unique to specific hardware. This paper proposes a novel hardware security primitive using a commercial off-the-shelf flash memory chip that is an intrinsic part of most commercial Internet of Things (IoT) devices. First, we define a hardware security source model to describe a hardware-based fixed random bit generator for use in security applications, such as cryptographic key generation. Then, we propose a hardware security primitive with flash memory by exploiting the variability of tunneling electrons in the floating gate. In accordance with the requirements for robustness against the environment, timing variations, and random errors, we developed an adaptive extraction algorithm for the flash PUF. Experimental results show that the proposed flash PUF successfully generates a fixed random response, where the uniqueness is 49.1%, steadiness is 3.8%, uniformity is 50.2%, and min-entropy per bit is 0.87. Thus, our approach can be applied to security applications with reliability and satisfy high-entropy requirements, such as cryptographic key generation for IoT devices.

R-S Decoder Design for Single Error Correction and Erasure Generation (단일오류 정정 및 Erasure 발생을 위한 R-S 복호기 설계)

  • Kim, Yong Serk;Song, Dong Il;Kim, Young Woong;Lee, Kuen Young
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.23 no.5
    • /
    • pp.719-725
    • /
    • 1986
  • Reed-solomon(R-S) code is very effective to coerrect both random and burst errors over a noise communication channel. However, the required hardware is very complex if the B/M algorithm was employed. Moreover, when the error correction system consists of two R-S decoder and de-interleave, the I/O data bns lines becomes 9bits because of an erasure flag bit. Thus, it increases the complexity of hardware. This paper describes the R-S decoder which consisits of a error correction section that uses a direct decoding algorithm and erasure generation section and a erasure generation section which does not use the erasure flag bit. It can be shown that the proposed R-S dicoder is very effective in reducing the size of required hardware for error correction.

  • PDF

The Effect of Wireless Channel Models on the Performance of Sensor Networks (채널 모델링 방법에 따른 센서 네트워크 성능 변화)

  • 안종석;한상섭;김지훈
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.4
    • /
    • pp.375-383
    • /
    • 2004
  • As wireless mobile networks have been widely adopted due to their convenience for deployment, the research for improving their performance has been actively conducted. Since their throughput is restrained by the packet corruption rate not by congestion as in wired networks, however, network simulations for performance evaluation need to select the appropriate wireless channel model representing the behavior of propagation errors for the evaluated channel. The selection of the right model should depend on various factors such as the adopted frequency band, the level of signal power, the existence of obstacles against signal propagation, the sensitivity of protocols to bit errors, and etc. This paper analyzes 10-day bit traces collected from real sensor channels exhibiting the high bit error rate to determine a suitable sensor channel model. For selection, it also evaluates the performance of two error recovery algorithms such as a link layer FEC algorithm and three TCPs (Tahoe, Reno, and Vegas) over several channel models. The comparison analysis shows that CM(Chaotic Map) model predicts 3-time less BER variance and 10-time larger PER(Packet Error Rate) than traces while these differences between the other models and traces are larger than 10-time. The simulation experiments, furthermore, prove that CM model evaluates the performance of these algorithms over sensor channels with the precision at least 10-time more accurate than any other models.

Extended Kalman Filter Method for Wi-Fi Based Indoor Positioning (Wi-Fi 기반 옥내측위를 위한 확장칼만필터 방법)

  • Yim, Jae-Geol;Park, Chan-Sik;Joo, Jae-Hun;Jeong, Seung-Hwan
    • Journal of Information Technology Applications and Management
    • /
    • v.15 no.2
    • /
    • pp.51-65
    • /
    • 2008
  • The purpose of this paper is introducing WiFi based EKF(Extended Kalman Filter) method for indoor positioning. The advantages of our EKF method include: 1) Any special equipment dedicated for positioning is not required. 2) implementation of EKF does not require off-line phase of fingerprinting methods. 3) The EKF effectively minimizes squared deviation of the trilateration method. In order to experimentally prove the advantages of our method, we implemented indoor positioning systems making use of the K-NN(K Nearest Neighbors), Bayesian, decision tree, trilateration, and our EKF methods. Our experimental results show that the average-errors of K-NN, Bayesian and decision tree methods are all close to 2.4 meters whereas the average errors of trilateration and EKF are 4.07 meters and 3.528 meters, respectively. That is, the accuracy of our EKF is a bit inferior to those of fingerprinting methods. Even so, our EKF is accurate enough to be used for practical indoor LBS systems. Moreover, our EKF is easier to implement than fingerprinting methods because it does not require off-line phase.

  • PDF