• Title/Summary/Keyword: codeword

Search Result 174, Processing Time 0.033 seconds

Modulation Code for Removing Error Patterns on 4-Level NAND Flash Memory (4-레벨 낸드 플래시 메모리에서 오류 발생 패턴 제거 변조 부호)

  • Park, Dong-Hyuk;Lee, Jae-Jin;Yang, Gi-Ju
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.12C
    • /
    • pp.965-970
    • /
    • 2010
  • In the NAND flash memory storing two bits per cell, data is discriminated among four levels of electrical charges. We refer to these four levels as E, P1, P2, and P3 from the low voltage. In the statistics, many errors occur when E and P3 are stored at the next cells. Therefore, we propose a coding scheme for avoiding E-P3 or P3-E data patterns. We investigate two modulation codes for 9/10 code (9 bit input and 5 symbol codeword) and 11/12 code (11 bit input and 6 symbol codeword).

Performance Analysis Based On Log-Likelihood Ratio in Orthogonal Code Hopping Multiplexing Systems Using Multiple Antennas (다중 안테나를 사용한 직교 부호 도약 다중화 시스템에서 로그 우도비 기반 성능 분석)

  • Jung, Bang-Chul;Sung, Kil-Young;Shin, Won-Yong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.12
    • /
    • pp.2534-2542
    • /
    • 2011
  • In this paper, we show that performance can be improved by using multiple antennas in the conventional orthogonal code hopping multiplexing (OCHM) scheme, which was proposed for accommodating a larger number of users with low channel activities than the number of orthogonal codewords used in code division multiple access (CDMA)-based communication systems through downlink statistical multiplexing. First, we introduce two different types of OCHM systems together with orthogonal codeword allocation strategies, and then derive their mathematical expression for log-likelihood ratio (LLR) values according to the two different schemes. Next, when a turbo encoder based on the LLR computation is used, we evaluate performance on the frame error rate (FER) for the aformentioned OCHM system. For comparison, we also show performance for the existing symbol mapping method using multiple antennas, which was used in 3GPP standards. As a result, it is shown that our OCHM system with multiple antennas based on the proposed orthogonal codeword allocation strategy leads to performance gain over the conventional system---energy required to satisfy a target FER is significantly reduced.

High-Speed Decoding Algorithm of Data Codeword in Two-Dimensional PDF417 Bar Code (이차원 PDF417 바코드에서 데이터 코드워드의 고속 디코딩 알고리즘)

  • Kim, Young-Jung;Cho, Young-Min;Lee, Jong-Yun
    • Journal of Digital Convergence
    • /
    • v.12 no.2
    • /
    • pp.285-293
    • /
    • 2014
  • Two-dimensional PDF417 bar code has a wide range of use and has a storage capacity to compress a large amount of data. With these characteristics, PDF417 has been used in various ways to prevent the forgery and alteration of important information in documents. On the other hand, previous decoding methods in PDF417 barcode are slow and inefficient because they simply employ the standard specifications of AIM (Association for Automatic Identification and Mobility). Therefore, this paper propose an efficient and fast algorithm of decoding PDF417 bar code. As a result, the proposed decoding algorithm will be more faster and efficient than previous methods.

Multilevel Modulation Codes for Holographic Data Storage (홀로그래픽 데이터 저장장치에서의 멀티레벨 변조부호)

  • Jeong, Seongkwon;Lee, Jaejin
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.9
    • /
    • pp.13-18
    • /
    • 2015
  • The mutilevel holographic data storage offers considerable advantage for capacity, since it can store more than one bit per pixel. In this paper, we search the number of codewords for each code depending on three conditions: (1) the number of levels, (2) the number of pixels in a codeword, and (3) the minimum Euclidean distance of a code. Increasing the number of levels per pixel creates more capacity, while causing more errors, by reducing the noise margin. Increasing the number of pixels in a codeword can increase the code rate, which means more capacity, but increases the complexity of the encoder/decoder of the code. Increasing the minimum distance of a code reduces the detection error, while reducing the code rate of the code. In such a fashion, a system design will always have pros and cons, but our task is to find out an effective one under the given conditions for the system requirements. Therefore, the numbers we searched can provide some guidelines for effective code design.

An Iterative Soft-Decision Decoding Algorithm of Block Codes Using Reliability Values (신뢰도 값을 이용한 블록 부호의 반복적 연판정 복호 알고리즘)

  • Shim, Yong-Geol
    • The KIPS Transactions:PartC
    • /
    • v.11C no.1
    • /
    • pp.75-80
    • /
    • 2004
  • An iterative soft-decision decoding algorithm of block codes is proposed. With careful examinations of the first hard-decision decoding result, the candidate codewords are efficiently searched for. An approach to reducing decoding complexity and lowering error probability is to select a small number of candidate codewords. With high probability, we include the codewords which are at the short distance from the received signal. The decoder then computes the distance to each of the candidate codewords and selects the codeword which is the closest. We can search for the candidate codewords which make the error patterns contain the bits with small reliability values. Also, we can reduce the cases that we select the same candidate codeword already searched for. Computer simulation results are presented for (23,12) Golay code. They show that decoding complexity is considerably reduced and the block error probability is lowered.

A Fast Coeff_token Decoding Method for Efficient Implimentation of H.264/AVC CAVLC Decoder (효율적인 H.264/AVC CAVLC 복호화기 구현을 위한 고속 Coeff_token 복원 방식)

  • Moon, Yong-Ho;Park, Tae-Hee
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.45 no.5
    • /
    • pp.35-42
    • /
    • 2008
  • In this paper, we propose a fast coeff_token decoding method based on the re-constructed VLCT. Since the conventional decoding method is still based on large memory accesses, it is not suitable for the multimedia services such as PMP, PMB, DVH-H where fast decoding and low power consumption are required. Based on the analysis for the codeword structure, new structure of the codeword and the corresponding memory architecture are developed in this paper. The simulation results show that the proposed algorithm achieves memory access saving from 10% to 57%, compared to the conventional decoding method. This meant that the issues of tow power consumption and high speed decoding can be resolved without video-quality and coding efficiency degradation.

DC-Suppression Selection Criteria of Multimode Modulation Code for Optical Recording (광 기록 시스템을 위한 멀티모드 변조 코드의 DC-억압 코드 선택 방법)

  • Lee, Myoung-Jin;Lee, Jun;Lee, Jae-Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.3C
    • /
    • pp.209-214
    • /
    • 2003
  • Multi-mode coding method is a reliable DC-suppression method. There are two ways to improve the DC-suppression performance. One is improving scrambler's performance, and the other is improving selection criteria. The latter uses the MRDS(minimum running digital sum) criterion. It is easy to calculate, but its performance goes down when the length of codeword is getting longer. The MSW(mean squared weight) criterion that is known as the best so far regardless of the length of codeword has the high complexity. In this paper, we present the new selection criteria, MPRDS(minimum peak RDS) and A BSRDS(absolute RDS). Their performance are close to the MSW, implementation is simple. And also we present the SC(sign change) that has a subsidiary role with the original selection criteria and improve the capacity.

Block Turbo Codes for High Order Modulation and Transmission Over a Fast Fading Environment (고차원변조 방식 및 고속 페이딩 전송 환경을 위한 블럭터보부호)

  • Jin, Xianggunag;Kim, Soo-Young;Kim, Won-Yong;Cho, Yong-Hoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.6A
    • /
    • pp.420-425
    • /
    • 2012
  • A forward error correction (FEC) coding techniques is one of time diversity techniques with which the effect of channel impairments due to noise and fading are spreaded over independently, and thus the performance could be improved. Therefore, the performance of the FEC scheme can be maximized if we minimize the correlation of channel information across over a codeword. In this paper, we propose a block turbo code with the maximized time diversity effect which may be reduced due to utilization of high order modulation schemes and due to transmission over a comparatively fast fading environment. Especially, we propose a very simple formula to calculate the address of coded bit allocation, and thus we do not need any additional outer interleavers, i.e., inter-codeword interleavers. The simulation resuts investigated in this paper reveal that the proposed scheme can provide the performance gain of more than a few decibels compared to the conventional schemes.

LTE-Based Macro Base Station Platform Architecture (LTE 기반 Macro 기지국 Platform 구조 연구)

  • Jeong, Chan-Bok;Bae, Hyeon-Deok
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.9
    • /
    • pp.861-869
    • /
    • 2014
  • This paper shows the research of a platform architecture relates to the LTE-based macro basestation; the proposed platform architecture is designed with the interface between the baseband signal and IF (Intermediate Frequency) per codeword. Using this method, we can smoothly transmit/receive a large amounts of data regardless of the number of antenna in a macro base station which is used technology such as massive MIMO. In this paper, We analyzed the evolution of LTE technology and the trend in the development of the LTE-based system. For validation of the proposed architecture, we compare the general architecture of a conventional with the proposed architecture. From the calculation results of transmission quantity data, we see that the proposed architecture can give better performance than the existing architecture. By presenting this architecture, we hope to provide a new foundation for Design and Implementation of a LTE base station platform which is used technology such as massive MIMO, carrier aggregation (CA), coordinated multi point (CoMP).

A Cooperative Hybrid ARQ Scheme with Adaptive Retransmission (적응 재전송을 적용한 협력 하이브리드 ARQ 기법)

  • Kang, Seong-Kyo;Wang, Jin-Soo;Kim, Yun-Hee;Song, Iick-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.3A
    • /
    • pp.213-220
    • /
    • 2009
  • Cooperative diversity is a promising technique for range extension and diversity increase without the use of multiple transmit antennas at the user equipment. In this paper, we propose a cooperative hybrid automatic repeat request relay method with adaptive retransmission to increase the throughput when the SNR of a source user is low. In the proposed method, the source user transmits the first segment of a codeword to relay users and a base station. If the base station fails to recover the information from the received packet, it requests the source or some relay users to retransmit the packet previously sent. In addition, the retransmission type of a selected user is chosen from repetition or incremental redundancy according to the quality of systematic bits in a turbo codeword. Simulation results show that the proposed method improves the throughput compared to conventional methods, and the improvement is significant when the source user has a low SNR.