• 말소리와 음성과학
• /
• 제10권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.

• 한국산학기술학회논문지
• /
• 제11권3호
• /
• pp.873-879
• /
• 2010

본 논문에서는 MPEG2(Moving Picture Expert Group 2)비디오 디코더에서 영상데이타를 디코딩하는 기술에 관한 것으로, 종래의 동여상 처리기에서는 허프만 코드화 처리를 하여 정지영상을 부호화한후 분할기반 부호화 방식의 동영상 처리기법을 사용하였으나 1프레임의 코드화시에도 많은 계산 알고리즘이 필요하고 이미지의 닮음정도를 객관적수치로 표현할 수 없으므로 비슷한 이미지를 중복 코드화 작업 및 전송 작업을 하는 결함이 있었다. 본 눈문에서는 이를 해결하기 위하여 이미지의 닮음정도를 수치화하고 기준값 이하의 영상은 코드화 작업을 하지않고 계산된 영상 변화값에 의해 구현된 영상으로 대체하여 저장 및 전송하도록 하여 시각적으로 전혀 거부감이 없는 동영상을 구현하였다.

• Journal of Communications and Networks
• /
• 제17권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.

• Journal of Communications and Networks
• /
• 제17권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.

• 전자공학회논문지
• /
• 제50권1호
• /
• pp.21-26
• /
• 2013

본 논문에서는 그룹(group)을 2개의 심볼(symbol)로 나누는 시스템을 제안하는데, 이 두 개의 더해진 심볼들은 다중화에 의해 분리된 후 역다중화 기술을 이용해 다시 합해진다. 제안된 시스템에서 간단한 PIC(Partial Interference Cancelation) 그룹 복호화 기술은 Double-ABBA(D-ABBA) 유사 직교(Quasi-Orthogonal) 시공간 부호(Space Time Code)를 위해 사용된다. 이 부호는 고차 MIMO(Multiple Input Multiple Output) 시공간 블록 부호화에서 복호화시에 복잡도를 줄여준다. 그리고 기존의 방법과 제안된 방법과의 성능을 비교한다.

• 한국인터넷방송통신학회논문지
• /
• 제11권4호
• /
• pp.187-194
• /
• 2011

본 논문에서는 JPEG(Joint Photographic Experts Group)영상 디코더에서 영상데이타를 디코딩하는 기술에 관한 것으로, 종래의 정지영상 처리기에서는 허프만 코드화 처리를 하여 제1영상을 부호화한후 분할기반 부호화 방식의 연속영상 처리기법을 사용하였으나 작은화면의 코드화시에도 많은 계산 알고리즘이 필요하고 이미지의 닮음정도를 객관적수치로 표현할 수 없어서 비슷한 이미지를 중복 코드화 및 전송 작업을 하는 결함이 있었다. 본 논문에서는 이를 해결하기 위하여 이미지의 닮음정도를 수치화하고 기준값 이하의 영상은 코드화 작업을 하지않고 계산된 영상 변화값에 의해 구현된 영상으로 대체하여 저장 및 전송하도록 저장용량의 감축 및 시각적으로 전혀 거부감이 없는 정지영상을 구현하였다.

• ETRI Journal
• /
• 제31권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.

• Journal of Communications and Networks
• /
• 제13권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.

• 대한전자공학회논문지TC
• /
• 제48권8호
• /
• pp.7-14
• /
• 2011

본 논문에서는 선형 분산 시공간 블록 부호(STBC)의 부분간섭 제거(PIC) 그룹 복호와 인터리브 준직교 시공간 블록 부호인 TBH와 Jafakhani의 $8{\times}8$ 행렬을 위한 부분 간섭 제거 그룹 복호를 제안한다. 수신기에서 사용하여 최대 다이버시티를 달성할 수 있는 부분간섭제거 그룹 복호는 시공간 블록 부호(STBC)에 포함된 심벌을 몇몇의 그룹으로 나누고, 선형 부분 간섭 제거가 이루어진 후에 개별적으로 각 그룹에 대한 복호를 진행한다. 이는 단일 그룹에 포함된 모든 심벌을 한꺼번에 복호하는 최대 우도(ML) 복호와 제로포싱(ZF) 후에 독립적인 하나의 심벌을 갖는 각 그룹에 대해 개별적으로 복호를 하는 제로포싱(ZF) 복호의 중간형태로 볼 수 있다. 부분 간섭 그룹 복호는 그룹의 심벌의 수를 선택함으로써 복잡도와 성능 간의 타협점(tradeoff)을 조절할 수 있는 프레임워크(framework)를 제공한다. 본 논문에서 제안한 부분 간섭 제거 그룹 복호를 통하여 복잡도를 상당히 감소시킬 수 있음을 확인할 수 있었다.

• Journal of Communications and Networks
• /
• 제6권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.