• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권10호
• /
• pp.2527-2543
• /
• 2013

A novel steganographic QR code algorithm, which not only coveys the secret into the widely-used QR barcode but also preserves the readability of QR content and the capability of error correction, is presented in this article. Different from the conventional applications for QR barcode, the designed algorithm conceals the secret into the QR modules directly by exploiting the error correction capability. General browsers can read the QR content from the QR code via barcode readers; however, only the authorized receiver can further reveal the secret from the QR code directly. The new mechanism can convey a larger secret payload along with adjustment of the QR version and error correction level. Moreover, the blind property allows the receiver to reveal the secret without the knowledge of the embedded position of modules. Experimental results demonstrate that the new algorithm is secure, efficient and feasible for the low-power QR readers and mobile devices.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 신호처리소사이어티 추계학술대회 논문집
• /
• pp.537-540
• /
• 2003

In this paper, we evaluated error correction performance and recording density of an optical disc system. The performance of Low-Density Parity Check code (LDPC) is compared to the HD-DVD (BD) ECC. The recording density of optical disc can be increased by reducing the redundancy of the user data. Moreover, since the correction capability of LDPC with decreased redundancy is better than that of BD, the recording density can also be increased by reducing the mark length of the data on the disc surface.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2001년도 하계학술대회 논문집 D
• /
• pp.2496-2498
• /
• 2001

광 디스크 channel상에서 RSPC의 error correction capability를 확률적인 계산 방법으로 계산하는 데는 많은 어려움이 있다. 그 이유는 바로 광 디스크 channel이 burst error channel이기 때문인데, 이 burst error를 어떻게 다루는 가에 따라 그 error correction capability는 사뭇 달라진다. 이 논문에서는 Sony의 dust error distribution[1] 아래에서 4-state Morkov Chain[2]로 modeling하고 그 결과를 가지고 burst error를 channel의 특성과 ECC format의 특성에 맞게 제어할 수 있는 확률적인 계산방법을 소개하고 그것을 simulation하고자 한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권2호
• /
• pp.485-499
• /
• 2021

Although non-binary low-density parity-check (NB-LDPC) codes have better error-correction capability than that of binary LDPC codes, their decoding complexity is significantly higher. Therefore, it is crucial to reduce the decoding complexity of NB-LDPC while maintaining their error-correction capability to adopt them for various applications. The extended min-sum (EMS) algorithm is widely used for decoding NB-LDPC codes, and it reduces the complexity of check node (CN) operations via message truncation. Herein, we propose a low-cost CN processing method to reduce the complexity of CN operations, which take most of the decoding time. Unlike existing studies on low complexity CN operations, the proposed method employs quick selection algorithm, thereby reducing the hardware complexity and CN operation time. The experimental results show that the proposed selection-based CN operation is more than three times faster and achieves better error-correction performance than the conventional EMS algorithm.

• ETRI Journal
• /
• 제21권2호
• /
• pp.9-21
• /
• 1999

In this paper, to enhance the performance of ${\pi}$/4-DQPSK (${\pi}$/4-differential quadrature phase shift keying), the scheme using nonredundant multiple error correction is proposed and investigated. This scheme for the differential detection of ${\pi}$/4-DQPSK uses the signal output which is delayed for more than two time slots as the parity check bit and applies it to nonredundant multiple error correction. The proposed system was used for studying the performance of ${\pi}$/4-DQPSK with Nonredundant Error Correction (NEC) in additive white Gaussian noise (AWGN) and Nakagami fade modeled mobile communication channel, and it was observed that the performance increased as the error correction capability increased.

• 한국통신학회논문지
• /
• 제24권12A호
• /
• pp.1948-1959
• /
• 1999

본 논문에서는 비용장 다중오류정정을 갖는 $\pi$/4-QPSK의 차동검파 시스템을 이용하여 가산성 가우시안 백색잡음(additive white Gaussian noise: AWGN)과 나카가미 늦은 페이딩(Nakagami slow fading)채널로 모델링된 이동통신채널에서 성능이 분석연구되었다. 비용장 다중오류정정은 두 개 이상의 타임스롯(time slots)만큼 지연되어 수신된 신호를 이용하여 형성된 출력이 패리티체크 비트가 되어 오류정정에 이용되었으며, 비용장연속 다중오류정정(NEC)의 차수가 증가함에 따라 성능이 증가됨을 보이고 나카가미 페이딩 변수가 증가함에 따라도 성능이 증가됨을 보였다.

• 전자공학회논문지S
• /
• 제34S권2호
• /
• pp.1-10
• /
• 1997

In this paper, an improved lower bound on the burst-error correcting capability of th ecyclic product code is presented and through the analysis of this new bound clustered cyclic product (CCP abbr.)code is proposed. The CCP code, to improve the burst-error correcting capability, combines the idea of clustering and the transmission method of cyclic product code. That is, a cluster which is defined in this paper as a group of consecutive code symbols is employed as a new transmission unit to the code array transmission of cyclic product code. the burst-error correcting capability of the CCP code is improved without a loss in the random-error correcting capability and performance comparison in the digital video camera records (DVCR) system shows the superiority of the proposed CCP code over conventional product codes.

• 대한전자공학회논문지TC
• /
• 제41권10호
• /
• pp.45-52
• /
• 2004

본 논문에서는 에러 예측회로를 사용하여 연집에러 입력시 성능저하를 보완한 경판정 비터비 디코더를 제안하였다. 비터비 디코더는 최대유사복호 알고리즘을 사용하므로 랜덤에러 입력시 정정능력이 뛰어나다. 반면에 연집에러 입력시 에러 정정능력이 매우 떨어지는 단점이 있다. 제안하는 에러 예측회로는 비터비 디코더의 연집에러에 대한 에러 정정특성을 향상시키는 기능으로 비터비 디코더에 에러가 입력됨에 따라 path metric값이 증가하는 것을 이용한다. Path metric의 최대값 증가량을 이용하여 연집에러 구간을 예측, 연집에러 구간에 대한 확률 값을 줄여준다. 제안된 알고리즘을 OFDM방식의 IEEE802.11a WLAN에 적용한 비터비 디코더는 AWGN채널에서는 기존의 비터비 디코더와 동일한 성능을 유지하며, 무선 채널 환경인 다중경로 페이딩 채널에서 발생할 수 있는 연집에러에 대하여 15% 개선된 성능을 보였다.

• ETRI Journal
• /
• 제29권1호
• /
• pp.27-35
• /
• 2007

Energy savings in orthogonal frequency division multiplexing (OFDM) systems is an active research area. In order to achieve a solution, we propose a new cooperative relaying scheme operated on a per subcarrier basis. This scheme improves the bit error rate (BER) performance of the conventional signal-to-noise ratio (SNR)-based selection relaying scheme by substituting SNR with symbol error probability (SEP) to evaluate the received signal quality at the relay more reliably. Since the cooperative relaying provides spatial diversity gain for each subcarrier, thus statistically enhancing the reliability of subcarriers at the destination, the total number of lost subcarriers due to deep fading is reduced. In other words, cooperative relaying can alleviate error symbols in a codeword so that the error correction capability of forward error correction codes can be fully exploited to improve the BER performance (or save transmission energy at a target BER). Monte-Carlo simulations validate the proposed approach.

• 전자공학회논문지A
• /
• 제30A권3호
• /
• pp.16-33
• /
• 1993

New decoding algorithm of double-error-correction Reed-Solmon codes over GF(2$^{8}$) for optical compact disks is proposed and decoding algorithm of RS codes with triple-error-correcting capability is presented in this paper. First of all. efficient algorithms for estimating the number of errors in the received code words are presented. The most complex circuits in the RS decoder are parts for soving the error-location numbers from error-location polynomial, so the complexity of those circuits has a great influence on overall decoder complexity. One of the most known algorithm for searching the error-location number is Chien's method, in which all the elements of GF(2$^{m}$) are substituted into the error-location polynomial and the error-location number can be found as the elements satisfying the error-location polynomial. But Chien's scheme needs another 1 frame delay in the decoder, which reduces decoding speed as well as require more stroage circuits for the received ocode symbols. The ther is Polkinghorn method, in which the roots can be resolved directly by solving the error-location polynomial. Bur this method needs additional ROM (readonly memory) for storing tthe roots of the all possible coefficients of error-location polynomial or much more complex cicuit. Simple, efficient, and high speed method for solving the error-location number and decoding algorithm of double-error correction RS codes which reudce considerably the complexity of decoder are proposed by using Hilbert theorems in this paper. And the performance of the proposed decoding algorithm is compared with that of conventional decoding algorithms. As a result of comparison, the proposed decoding algorithm is superior to the conventional decoding algorithm with respect to decoding delay and decoder complexity. And decoding algorithm of RS codes with triple-error-correcting capability is presented, which is suitable for error-correction in digital audio tape, also.