• Title/Summary/Keyword: System Codes

Search Result 1,747, Processing Time 0.027 seconds

Locally Repairable Fractional Repetition Codes (부분접속 복구 가능한 반복분할 부호)

  • Nam, Mi-Young;Kim, Jung-Hyun;Song, Hong-Yeop
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.9
    • /
    • pp.1741-1753
    • /
    • 2015
  • In this paper, we introduce new locally repairable codes based on a Fractional repetition codes which is one of the MBR codes. We introduce two different constructions for different system parameters and compare these codes in terms of several performance metrics. There is some tradeoffs between the locality and other performance metrics. The newly introduced codes having the good locality should pay the price such as lower capacity or more storage nodes. And the proposed codes are more reliable than other locally repairable codes and have lower repair complexity since they can be repaired without any operations.

Performance Analysis of Concatenated Codes for High Altitude Platform System (성층권 통신시스템을 위한 연접부호의 성능분석)

  • 백동철;안도섭;구본준;박광량
    • Proceedings of the IEEK Conference
    • /
    • 1999.11a
    • /
    • pp.759-762
    • /
    • 1999
  • In this paper, we introduce the concept of a HAPS(High Altitude Platform Station) system which is expected to be a next generation communication system and suggest several error correcting codes to provide high quality services. Since a HAPS system encounters serious signal attenuation due to rain and scattering in the air, concatenated codes which have a high coding gain is considered to be a proper error correcting method. In this paper, we provide performance analyses result of two candidate coding schemes for a HAPS. The first one is a conventional concatenated coding scheme, and the second one is a iterative decoding method known as Turbo Codes.

  • PDF

Performance Of Iterative Decoding Schemes As Various Channel Bit-Densities On The Perpendicular Magnetic Recording Channel (수직자기기록 채널에서 기록 밀도에 따른 반복복호 기법의 성능)

  • Park, Dong-Hyuk;Lee, Jae-Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.7C
    • /
    • pp.611-617
    • /
    • 2010
  • In this paper, we investigate the performances of the serial concatenated convolutional codes (SCCC) and low-density parity-check (LDPC) codes on perpendicular magnetic recording (PMR) channels. We discuss the performance of two systems when user bit-densities are 1.7, 2.0, 2.4 and 2.8, respectively. The SCCC system is less complex than LDPC system. The SCCC system consists of recursive systematic convolutional (RSC) codes encoder/decoder, precoder and random interleaver. The decoding algorithm of the SCCC system is the soft message-passing algorithm and the decoding algorithm of the LDPC system is the log domain sum-product algorithm (SPA). When we apply the iterative decoding between channel detector and the error control codes (ECC) decoder, the SCCC system is compatible with the LDPC system even at the high user bit density.

Low BER Channel Coding For WiBro Modem Design (WiBro 모뎀 설계를 위한 Low BER 채널 코딩)

  • Lee, Min-Young;Kim, In-Soo;Min, Hyoung-Bok
    • Proceedings of the KIEE Conference
    • /
    • 2008.07a
    • /
    • pp.2271-2272
    • /
    • 2008
  • Recently, LDPC codes received a lot of attention in 4G. LDPC codes perform good error correction at high SNR. But LDPC codes are complex design and not good at low SNR. At low SNR, convolution codes and turbo codes show more good performance than LDPC codes. The main subject presented in this study is that parallel encoding and decoding according to SNR. The system chooses convolution codes at low SNR and chooses LDPC codes at high SNR.

  • PDF

Combination Methods for Distribution Codes (분산 부호의 결합 기법)

  • Chung, Jin-Ho
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2022.05a
    • /
    • pp.365-366
    • /
    • 2022
  • The distributed code is a type of linear codes that can be used for coding and federated learning for privacy. In the distributed code, privacy or confidential information is not dependent to each other because the information of each code is not included with other codes. In this paper, we examine the properties of these distributed codes and present techniques for synthesizing new sets of distributed codes from previously known distributed codes. In addition, we propose several scenarios in which combined codes can be used.

  • PDF

An Optimal Space Time Coding Algorithm with Zero Forcing Method in Underwater Channel (수중통신에서 Zero Forcing기법을 이용한 최적의 시공간 부호화 알고리즘)

  • Kwon, Hae-Chan;Park, Tae-Doo;Chun, Seung-Yong;Lee, Sang-Kook;Jung, Ji-Won
    • Journal of Navigation and Port Research
    • /
    • v.38 no.4
    • /
    • pp.349-356
    • /
    • 2014
  • In the underwater communication, the performance of system is reduced because of the inter-symbol interference occur by the multi-path. In the recent years, to deal with poor channel environment and improve the throughput, the efficient concatenated structure of equalization, channel codes and Space Time Codes has been studied as MIMO system in the underwater communication. Space Time Codes include Space Time Block Codes and Space Time Trellis Codes in underwater communication. Space Time Trellis Codes are optimum for equalization and channel codes among the Space Time Codes to apply in the MIMO environment. Therefore, in this paper, turbo pi codes are used for the outer code to efficiently transmit in the multi-path channel environment. The inner codes consist of Space Time Trellis Codes with transmission diversity and coding gain in the MIMO system. And Zero Forcing method is used to remove inter-symbol interference. Finally, the performance of this model is simulated in the underwater channel.

Efficient Evaluation of Path Algebra Expressions

  • Lee, Tae-kyong
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.5 no.1
    • /
    • pp.1-15
    • /
    • 2000
  • In this paper, an efficient system for finding answers to a given path algebra expression in a directed acylic graph is discussed more particulary, in a multimedia presentration graph. Path algebra expressions are formulated using revised versions of operators next and until of temporal logic, and the connected operator. To evaluate queries with path algebra expressions, the node code system is proposed. In the node code system, the nodes of a presentation graph are assigned binary codes (node codes) that are used to represent nodes and paths in a presentation graph. Using node codes makes it easy to find parent-child predecessor-sucessor relationships between nodes. A pair of node codes for connected nodes uniquely identifies a path, and allows efficient set-at-a-time evaluations of path algebra expressions. In this paper, the node code representation of nodes and paths in multimedia presentation graphs are provided. The efficient algorithms for the evaluation of queries with path algebra expressions are also provided.

  • PDF

A Study on Cross-correlation Control Schemes on Walsh and Golay Codes Based on the Orthogonal Transformation and BER Performance Evaluation of Asynchronous CDMA System Using the Modified Codes (직교변환에 의한 Walsh 및 Golay 코드의 상호상관 제어방식과 수정된 코드를 사용한 비동기 CDMA 시스템의 비트오율 성능에 관한 연구)

  • Lee, Won-Chang;Kim, Myoung-Jin
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.9 no.4
    • /
    • pp.304-312
    • /
    • 2008
  • Orthogonal codes like Walsh and Golay codes may have large correlation value when they are not synchronized, hence they are seldom used in asynchronous CDMA systems. Wysocki[1] showed that by multiplying the original Walsh-Hadamard matrix with an orthogonal transformation matrix the resultant matrix sustains orthogonality between row vectors and their cross-correlation can be reduced. Soberly and Wysocki[2] proposed similar scheme on Golay codes. This implies that using the proper orthogonal transformation cross-correlation of Walsh and Golay codes can be reduced, and the transformed codes can be used for user separation in the CDAM reverse link. In this paper we discuss cross-correlation related parameters which affect the performance of an asynchronous CDMA link, and we investigate the correlation properties of the transformed codes. When we designed orthogonal transformation matrices for Walsh and Golay codes, we minimized the maximum value of aperiodic cross-correlation of the codes ($ACC_{max}$) or the mean square value of the aperiodic cross-correlation($R_{cc}$) with preserving the orthogonality of the modified codes. We also evaluate the asynchronous CDMA system that uses the transformed Walsh and Golay codes.

  • PDF

64 Bit EISC Processor Design (64 Bit EISC 프로세서 설계)

  • 임종윤;이근택
    • Proceedings of the IEEK Conference
    • /
    • 2000.06b
    • /
    • pp.161-164
    • /
    • 2000
  • The architecture of microprocessor for a embedded system should be one that can perform more tasks with fewer instruction codes. The machine codes that high-level language compiler produces are mainly composed of specific ones, and codes that have small size are more frequently used. Extended Instruction Set Architecture (EISC) was proposed for that reason. We have designed pipe-line system for 64 bit EISC microprocessor. function level simulator was made for verification of design and instruction set architecture was also verified by that simulator. The behavioral function of synthesized logic was verified by comparison with the results of cycle-based simulator.

  • PDF

Analysis of Performance of Data Communications Using Error Control Codes on Electrical Power Lines (전력선에서의 에러 정정 코드에 의한 데이터 전송 성능 분석)

  • 송왕철;정호영;김신령;강창언
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.28A no.5
    • /
    • pp.339-346
    • /
    • 1991
  • In this paper the performance of communication system in the electrical power line using error correcting codes is analysed. The BCH codes and interleaved code are to be used for correcting burst and random errors in the power line channels. The data rate of 2400 bps and the carrier frequency of 12KHz are assumed. Actual power line noise is recorded and simulated in the BPSK PLC system model.

  • PDF