• 제목/요약/키워드: encoding-decoding

검색결과 340건 처리시간 0.023초

Nonuniform Encoding and Hybrid Decoding Schemes for Equal Error Protection of Rateless Codes

  • Lim, Hyung Taek;Joo, Eon Kyeong
    • ETRI Journal
    • /
    • 제34권5호
    • /
    • pp.719-726
    • /
    • 2012
  • Messages are generally selected with the same probability in the encoding scheme of rateless codes for equal error protection. In addition, a belief propagation (BP) decoding scheme is generally used because of the low computational complexity. However, the probability of recovering a new message by BP decoding is reduced if both the recovered and unrecovered messages are selected uniformly. Thus, more codeword symbols than expected are required for the perfect recovery of message symbols. Therefore, a new encoding scheme with a nonuniform selection of messages is proposed in this paper. In addition, a BP-Gaussian elimination hybrid decoding scheme that complements the drawback of the BP decoding scheme is proposed. The performances of the proposed schemes are analyzed and compared with those of the conventional schemes.

MPEG DCT 계수의 특징을 이용한 효율적인 VLC/VLD의 VLSI 설계 (VLSI design of efficient VLC/VLD utilizing the characteristics of MPEG DCT coefficients)

  • 공종필;김영민
    • 전자공학회논문지B
    • /
    • 제33B권1호
    • /
    • pp.79-86
    • /
    • 1996
  • 본 논문은 가변길이코드의 encoding/decoding를 위한 간단하고도 메모리 측면에서 효율적인 구조를 제안한다. MPEG1 DCT계수를 encoding/decoding함으로써 구현한 본 구조에서 114개의 DCT계수를 메모리 매핑하는데 최소인 7비트의 어드레스가 할당되도록 하였고, 직렬-병렬 및 병렬-직렬 변환용 쉬프트 레지스터와 code mapping ROM을 결합시킨 구조로써 최소의 플립플롭 및 메모리를 사용하여 구현하였다. 속도측면에선 COMPASS tool(0.8${\mu}m$ CMOS technology standard cells)을 사용해서 시뮬레이션 해본 결과 encoding/decoding의 경우 모두 50Mbps의 동작속도를 얻을 수 있었다.

  • PDF

Constant Luminance Signal Coding 에 관한 연구 (A Study on Constant Luminance Signal Coding)

  • 김진서;조맹섭
    • 한국정보처리학회:학술대회논문집
    • /
    • 한국정보처리학회 2000년도 추계학술발표논문집 (하)
    • /
    • pp.859-862
    • /
    • 2000
  • 본 논문에서는 기존의 TV 시스템에서 사용하는 영상신호의 encoding/decoding 방법과 새롭게 제안되는 constant luminance encoding/decoding 방법을 컴퓨터로 구현하고, 기존의 방법과 제안된 방법으로 재생된 영상의 칼라 정보의 차이에 대한 데이터를 제시한다. 또한 디지털 방송에 적합한 encoding/decoding 시스템의 선택에 대한 고찰도 포함한다.

  • PDF

5~8세 아동의 철자지식과 음운인식이 시각적 단어 해독과 부호화에 미치는 영향 (Effects of Orthographic Knowledge and Phonological Awareness on Visual Word Decoding and Encoding in Children Aged 5-8 Years)

  • 나예주;하지완
    • 디지털융복합연구
    • /
    • 제14권6호
    • /
    • pp.535-546
    • /
    • 2016
  • 철자지식과 음운인식이 시각적 단어 해독과 부호화에 미치는 영향을 알아보기 위하여, 5세에서 8세의 아동 각 15명씩 총 60명을 대상으로 철자지식(자모지식, 소리-글자 대응지식, 철자표상), 음운인식(단어인식, 음절인식, 음소인식), 시각적 단어 해독(자소-음소 일치 단어 읽기, 불일치 단어 읽기), 시각적 단어 부호화(자소-음소 일치 단어 받아쓰기, 불일치 단어 받아쓰기) 과제를 실시하였다. 그 결과 철자지식, 음운인식, 시각적 단어 해독, 시각적 단어 부호화의 모든 과제에서 연령 집단 간 수행력 차이가 유의하였고, 각 과제 수행력 간 유의한 정적 상관관계가 있었다. 이 중 불일치 단어 철자표상, 음절인식, 음소인식이 본 연구 대상자들을 연령에 따라 보다 민감하게 구분하는 것으로 나타났다. 시각적 단어 해독과 부호화 능력을 예측하는 변인으로 음운인식보다는 자모지식과 철자표상과 같은 철자지식 능력이 포함되었다. 본 연구결과는 학령기 전후 철자에 보다 익숙해지면 음운인식보다 철자지식이 시각적 단어 해독과 부호화에 더 많은 영향을 미친다는 것을 시사한다.

평균 영상 추정을 이용한 고속 플랙탈 영상 복원 알고리즘 (A fast fractal decoding algorithm using averaged-image estimation)

  • 문용호;박태희;김재호
    • 한국통신학회논문지
    • /
    • 제23권9A호
    • /
    • pp.2355-2364
    • /
    • 1998
  • In conventional fractal decoding procedure, the reconstructed image is obtained by a rpredefined number of iterations starting with an arbitrary initial image. Its convergence speed depends on the selection of the initial image. It should be solved to get high speed convergence. In this paper, we theoretically reveal that conventional method is approximately decomposed into the decoding of the DC and AC components. Based on this fact, we proposed a novel fast fractal decoding algorithm made up of two steps. The averaged-image considered as an optimal initial image is estimated in the first step. In the second step, the reconstructe dimag eis genrated from the output image obtained in the first step. From the simulations, it is shown that the output image of the first step approximately converges to the averaged-image with only 15% calculations for one iteration of conventional method. And the proposed method is faster than various decoding mehtods and evenly equal to conventioanl decoding with the averaged-image. In addition, the proposed method can be applied to the compressed data resulted from the various encoding methods because it does not impose any constraints in the encoding procedure to get high decoding speed.

  • PDF

Comparison Study of Multi-class Classification Methods

  • Bae, Wha-Soo;Jeon, Gab-Dong;Seok, Kyung-Ha
    • Communications for Statistical Applications and Methods
    • /
    • 제14권2호
    • /
    • pp.377-388
    • /
    • 2007
  • As one of multi-class classification methods, ECOC (Error Correcting Output Coding) method is known to have low classification error rate. This paper aims at suggesting effective multi-class classification method (1) by comparing various encoding methods and decoding methods in ECOC method and (2) by comparing ECOC method and direct classification method. Both SVM (Support Vector Machine) and logistic regression model were used as binary classifiers in comparison.

DOMAIN BLOCK ESTIMATING FUNCTION FOR FRACTAL IMAGE CODING

  • Kousuke-Imamura;Yuuji-Tanaka;Hideo-Kuroda
    • 한국방송∙미디어공학회:학술대회논문집
    • /
    • 한국방송공학회 1999년도 KOBA 방송기술 워크샵 KOBA Broadcasting Technology Workshop
    • /
    • pp.57.2-62
    • /
    • 1999
  • Fractal coding is image compression techniques using one of image characteristics self-transformability. In fractal image coding, the encoding process is to select the domain block similar to a range block. The reconstructed image quality of fractal image coding depends on similitude between a range block and the selected domain block. Domain block similar to a range blocks. In fact, the error of the reconstructed image adds up the generated error in encoding process and the generated error in decoding process. But current domain block estimating function considered only the encoding error. We propose a domain block estimating function to consider not only the encoding error but also the decoding error. By computer simulation, it was verified to obtain the high quality reconstructed image.

Accurate Representation of Light-intensity Information by the Neural Activities of Independently Firing Retinal Ganglion Cells

  • Ryu, Sang-Baek;Ye, Jang-Hee;Kim, Chi-Hyun;Goo, Yong-Sook;Kim, Kyung-Hwan
    • The Korean Journal of Physiology and Pharmacology
    • /
    • 제13권3호
    • /
    • pp.221-227
    • /
    • 2009
  • For successful restoration of visual function by a visual neural prosthesis such as retinal implant, electrical stimulation should evoke neural responses so that the informat.ion on visual input is properly represented. A stimulation strategy, which means a method for generating stimulation waveforms based on visual input, should be developed for this purpose. We proposed to use the decoding of visual input from retinal ganglion cell (RGC) responses for the evaluation of stimulus encoding strategy. This is based on the assumption that reliable encoding of visual information in RGC responses is required to enable successful visual perception. The main purpose of this study was to determine the influence of inter-dependence among stimulated RGCs activities on decoding accuracy. Light intensity variations were decoded from multiunit RGC spike trains using an optimal linear filter. More accurate decoding was possible when different types of RGCs were used together as input. Decoding accuracy was enhanced with independently firing RGCs compared to synchronously firing RGCs. This implies that stimulation of independently-firing RGCs and RGCs of different types may be beneficial for visual function restoration by retinal prosthesis.

정의역 탐색영역 제한 부호화 알고리듬을 이용한 고속 프랙탈 영상복원 (A Fast Fractal Image Decoding Using the Encoding Algorithm by the Limitation of Domain Searching Regions)

  • 정태일;강경원;권기룡;문광석;김문수
    • 융합신호처리학회 학술대회논문집
    • /
    • 한국신호처리시스템학회 2000년도 추계종합학술대회논문집
    • /
    • pp.125-128
    • /
    • 2000
  • 기존의 프랙탈 영상복원은 모든 치역 블럭에 대해 반복축소변환을 수행하므로 복원시 많은 계산량이 요구되었다. 이를 개선하기 위해 각 치역 블록마다 반복축소변환이 필요한 영역과 필요하지 않은 영역으로 구분하는 방법이 제시되었다. 만약 반복축소변환 영역이 줄어든다면 고속 복원이 가능하다. 본 논문에서는 부호화 과정에서 정의역 블록의 탐색 영역을 치역 블록과 비슷한 영역으로 제한하여 반복축소변환이 필요한 영역을 최소화한다. 그래서 반복축소변환에 필요한 계산량을 감소시켜 고속 복원이 가능하다.

  • PDF

Design and Performance of Space-Time Trellis Codes for Rapid Rayleigh Fading Channels

  • Zummo, Salam A.;Al-Semari, Saud A.
    • Journal of Communications and Networks
    • /
    • 제5권2호
    • /
    • pp.174-183
    • /
    • 2003
  • Space-Time (ST) codes are known to provide high transmission rates, diversity and coding gains. In this paper, a tight upper bound on the error probability of ST codes over rapid fading channels is presented. Moreover, ST codes suitable for rapid fading channels are presented. These codes are designed using the QPSK and 16-QAM signal constellations. The proposed codes are based on two different encoding schemes. The first scheme uses a single trellis encoder, whereas the second scheme uses the I-Q encoding technique. Code design is achieved via partitioning the signal space such that the design criteria are maximized. As a solution for the decoding problem of I-Q ST codes, the paper introduces a low-complexity decoding algorithm. Results show that the I-Q ST codes using the proposed decoding algorithm outperform singleencoder ST codes with equal complexity. The proposed codes are tested over fading channels with different interleaving conditions, where it is shown that the new codes are robust under such imperfect interleaving conditions.