• Title/Summary/Keyword: group decoding

Search Result 84, Processing Time 0.023 seconds

Korean first graders' word decoding skills, phonological awareness, rapid automatized naming, and letter knowledge with/without developmental dyslexia (초등 1학년 발달성 난독 아동의 낱말 해독, 음운인식, 빠른 이름대기, 자소 지식)

  • Yang, Yuna;Pae, Soyeong
    • Phonetics and Speech Sciences
    • /
    • v.10 no.2
    • /
    • pp.51-60
    • /
    • 2018
  • This study aims to compare the word decoding skills, phonological awareness (PA), rapid automatized naming (RAN) skills, and letter knowledge of first graders with developmental dyslexia (DD) and those who were typically developing (TD). Eighteen children with DD and eighteen TD children, matched by nonverbal intelligence and discourse ability, participated in the study. Word decoding of Korean language-based reading assessment(Pae et al., 2015) was conducted. Phoneme-grapheme correspondent words were analyzed according to whether the word has meaning, whether the syllable has a final consonant, and the position of the grapheme in the syllable. Letter knowledge asked about the names and sounds of 12 consonants and 6 vowels. The children's PA of word, syllable, body-coda, and phoneme blending was tested. Object and letter RAN was measured in seconds. The decoding difficulty of non-words was more noticeable in the DD group than in the TD one. The TD children read the syllable initial and syllable final position with 99% correctness. Children with DD read with 80% and 82% correctness, respectively. In addition, the DD group had more difficulty in decoding words with two patchims when compared with the TD one. The DD group read only 57% of words with two patchims correctly, while the TD one read 91% correctly. There were significant differences in body-coda PA, phoneme level PA, letter RAN, object RAN, and letter-sound knowledge between the two groups. This study confirms the existence of Korean developmental dyslexics, and the urgent need for the inclusion of a Korean-specific phonics approach in the education system.

New Moving Picture Decoding Process using Picture Resemblance (닮은꼴을 이용한 새로운 동영상 디코딩 처리방법)

  • Soo, Jin-Hyun
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.11 no.3
    • /
    • pp.873-879
    • /
    • 2010
  • In this paper, MPEG2(Moving Picture Expert Group 2) image data video decoding technique is presented, it is Huffman decoding method and fractal image method which is very complexive algorithm and have too much times to implement this method. This have defect of overlap decoding and transport work because of impossible to represent objective value of resemblance. The proposed method was calculated the mathematical absolute image resemblance and simplify the moving picture process to reducing the step of moving picture codefying. The results show that smoothed moving picture compared recent methods.

Iterative Group Detection and Decoding for Large MIMO Systems

  • Choi, Jun Won;Lee, Byungju;Shim, Byonghyo
    • Journal of Communications and Networks
    • /
    • v.17 no.6
    • /
    • pp.609-621
    • /
    • 2015
  • Recently, a variety of reduced complexity soft-in soft-output detection algorithms have been introduced for iterative detection and decoding (IDD) systems. However, it is still challenging to implement soft-in soft-output detectors for MIMO systems due to heavy burden in computational complexity. In this paper, we propose a soft detection algorithm for MIMO systems which performs close to the full dimensional joint detection, yet offers significant complexity reduction over the existing detectors. The proposed algorithm, referred to as soft-input soft-output successive group (SSG) detector, detects a subset of symbols (called a symbol group) successively using a deliberately designed preprocessing to suppress the inter-group interference. In fact, the proposed preprocessor mitigates the effect of the interfering symbol groups successively using a priori information of the undetected groups and a posteriori information of the detected groups. Simulation results on realistic MIMO systems demonstrate that the proposed SSG detector achieves considerable complexity reduction over the conventional approaches with negligible performance loss.

New Decoding Scheme for LDPC Codes Based on Simple Product Code Structure

  • Shin, Beomkyu;Hong, Seokbeom;Park, Hosung;No, Jong-Seon;Shin, Dong-Joon
    • Journal of Communications and Networks
    • /
    • v.17 no.4
    • /
    • pp.351-361
    • /
    • 2015
  • In this paper, a new decoding scheme is proposed to improve the error correcting performance of low-density parity-check (LDPC) codes in high signal-to-noise ratio (SNR) region by using post-processing. It behaves as follows: First, a conventional LDPC decoding is applied to received LDPC codewords one by one. Then, we count the number of word errors in a predetermined number of decoded codewords. If there is no word error, nothing needs to be done and we can move to the next group of codewords with no delay. Otherwise, we perform a proper post-processing which produces a new soft-valued codeword (this will be fully explained in the main body of this paper) and then apply the conventional LDPC decoding to it again to recover the unsuccessfully decoded codewords. For the proposed decoding scheme, we adopt a simple product code structure which contains LDPC codes and simple algebraic codes as its horizontal and vertical codes, respectively. The decoding capability of the proposed decoding scheme is defined and analyzed using the parity-check matrices of vertical codes and, especially, the combined-decodability is derived for the case of single parity-check (SPC) codes and Hamming codes used as vertical codes. It is also shown that the proposed decoding scheme achieves much better error correcting capability in high SNR region with little additional decoding complexity, compared with the conventional LDPC decoding scheme.

An Optimized Double-ABBA Quasi-Orthogonal Space Time Code with PIC Group Decoding (PIC 그룹 복호화를 이용한 최적화된 Double-ABBA 유사 직교 시공간 부호)

  • Hanif, Mohammad Abu;Lee, Moon Ho;Park, Ju Yong
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.1
    • /
    • pp.21-26
    • /
    • 2013
  • In this paper we propose a system where we divide the group with 2 symbols. The two added symbols are separated by multiplexing and later added using the DE-multiplexing technique. In our proposed system a simple Partial Interference Cancelation (PIC) group decoding scheme is used for Double-ABBA(D-ABBA) Quasi-Orthogonal Space Time Code, which reduces the decoding complexity for the higher order Multiple Input Multiple Output (MIMO) space time block coding. Finally we compare the proposed scheme performance using the different modulation schemes.

Establishment Threshold Value of Image Realization & Reconstruction of Stoppage Image using Picture Resemblance (닮은꼴을 이용한 영상구현 임계값설정과 정지영상 복원법)

  • Jin, Hyun-Soo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.4
    • /
    • pp.187-194
    • /
    • 2011
  • In this paper, JPEG(Joint Photographic Experts Group) image data video decoding technique is presented, it is Huffman decoding method and fractal image method which is very complexive algorithm and the time required much it to implement this method and the first image is decoded to video frame image. This have defect of overlap decoding and transport work because of impossible to represent objective value of resemblance. The proposed method was calculated the mathematical absolute image resemblance and simplify the moving picture process to reducing the step of moving picture codefying. The results show that smoothed moving picture compared recent methods.

Complexity Reduction Method for BSAC Decoder

  • Jeong, Gyu-Hyeok;Ahn, Yeong-Uk;Lee, In-Sung
    • ETRI Journal
    • /
    • v.31 no.3
    • /
    • pp.336-338
    • /
    • 2009
  • This letter proposes a complexity reduction method to speed up the noiseless decoding of a bit-sliced arithmetic coding (BSAC) decoder. This scheme fully utilizes the group of consecutive arithmetic-coded symbols known as the decoding band and the significance tree structure sorted in order of significance at every decoding band. With the same audio quality, the proposed method reduces the number of calculations that are performed during the noiseless decoding in BSAC to about 22% of the amount of calculations with the conventional full-search method.

  • PDF

On the (n, m, k)-Cast Capacity of Wireless Ad Hoc Networks

  • Kim, Hyun-Chul;Sadjadpour, Hamid R.;Garcia-Luna-Aceves, Jose Joaquin
    • Journal of Communications and Networks
    • /
    • v.13 no.5
    • /
    • pp.511-517
    • /
    • 2011
  • The capacity of wireless ad-hoc networks is analyzed for all kinds of information dissemination based on single and multiple packet reception schemes under the physical model. To represent the general information dissemination scheme, we use (n, m, k)-cast model [1] where n, m, and k (k ${\leq}$ m) are the number of nodes, destinations and closest destinations that actually receive packets from the source in each (n, m, k)-cast group, respectively. We first consider point-to-point communication, which implies single packet reception between transmitter-receiver pairs and compute the (n, m, k)-cast communications. Next, the achievable throughput capacity is computed when receiver nodes are endowed with multipacket reception (MPR) capability. We adopt maximum likelihood decoding (MLD) and successive interference cancellation as optimal and suboptimal decoding schemes for MPR. We also demonstrate that physical and protocol models for MPR render the same capacity when we utilize MLD for decoding.

8 Antenna Interleaved Quasi Orthogonal Space Time Block Code TBH with PIC Group Decoding (8 안테나 인터리브 시스템을 위한 준직교 시공간 블록 부호 TBH의 부분 간섭 제거 그룹 복호 알고리즘)

  • Lee, Moon-Ho;Lee, Mi-Sung;Hanif, Mohammad Abu;Park, Ju-Yong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.48 no.8
    • /
    • pp.7-14
    • /
    • 2011
  • In this paper we studied a conventional system and propose a new decoding scheme for Space-time Frequency Code with Interleaved System. We also addressed the quasi orthogonal function with Jacket matrices in modern 3GPP LTE uplinked advance system. We also introduce the Partial Interference Cancellation (PIC) group decoding which provides a framework to adjust the complexity-performance tradeoff by choosing the sizes of the information symbols groups.

Butterfly Log-MAP Decoding Algorithm

  • Hou, Jia;Lee, Moon Ho;Kim, Chang Joo
    • Journal of Communications and Networks
    • /
    • v.6 no.3
    • /
    • pp.209-215
    • /
    • 2004
  • In this paper, a butterfly Log-MAP decoding algorithm for turbo code is proposed. Different from the conventional turbo decoder, we derived a generalized formula to calculate the log-likelihood ratio (LLR) and drew a modified butterfly states diagram in 8-states systematic turbo coded system. By comparing the complexity of conventional implementations, the proposed algorithm can efficiently reduce both the computations and work units without bit error ratio (BER) performance degradation.