• 대한전자공학회논문지SD
• /
• 제47권5호
• /
• pp.10-15
• /
• 2010

Hadamard code를 이용한 spectral-amplitude-coding optical code-division multiple-access(OCDMA)는 효율적인 시스템을 구성할 수 있으나 $2^n$개의 code length만을 갖는 특성을 지닌다. 이의 한계성을 극복할 수 있는 extended Hadamard codes를 제안하고 주된 잡음인 phase-induced intensity noise(PIIN)를 분석하여 향상된 시스템의 특성을 보인다.

• 대한수학회보
• /
• 제60권3호
• /
• pp.829-844
• /
• 2023

In this paper, we present a new construction for self-dual codes that uses the concept of double bordered construction, group rings, and reverse circulant matrices. Using groups of orders 2, 3, 4, and 5, and by applying the construction over the binary field and the ring F₂ + uF₂, we obtain extremal binary self-dual codes of various lengths: 12, 16, 20, 24, 32, 40, and 48. In particular, we show the significance of this new construction by constructing the unique Extended Binary Golay Code [24, 12, 8] and the unique Extended Quadratic Residue [48, 24, 12] Type II linear block code. Moreover, we strengthen the existing relationship between units and non-units with the self-dual codes presented in [10] by limiting the conditions given in the corollary. Additionally, we establish a relationship between idempotent and self-dual codes, which is done for the first time in the literature.

• 한국통신학회논문지
• /
• 제38C권1호
• /
• pp.109-117
• /
• 2013

극 부호(polar codes)는 광범위한 이진 입력 이산 무기억 채널(binary input discrete memoryless channel: BI-DMC)에서 채널 용량에 달성하는 것이 이론적으로 증명된 최초의 채널부호이다. 하지만 유한한 길이를 갖는 극 부호는 연속 제거 리스트(successive-cancellation list: SCL) 복호기에서 오류마루(error floor)가 발생하는 문제점이 있다. 선행 연구에 따르면 이 오류마루 현상은 극 부호에 오류 검출 코드(error detection codes) 중 하나인 CRC(Cyclic Redundancy Check) 부호를 연접했을 때 효과적으로 낮출 수 있는 것으로 알려져 있다. 본 논문에서는 외부 부호(outer codes)를 사용하지 않고 극 부호와 RM(Reed-Muller) 부호의 생성 행렬 연관성을 이용하여 기존 극 부호보다 확장된 최소거리를 갖는 극 부호를 제안한다. 그리고 제안된 극 부호와 CRC 부호를 연접한 극 부호의 성능을 비교한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권2호
• /
• pp.485-499
• /
• 2021

Although non-binary low-density parity-check (NB-LDPC) codes have better error-correction capability than that of binary LDPC codes, their decoding complexity is significantly higher. Therefore, it is crucial to reduce the decoding complexity of NB-LDPC while maintaining their error-correction capability to adopt them for various applications. The extended min-sum (EMS) algorithm is widely used for decoding NB-LDPC codes, and it reduces the complexity of check node (CN) operations via message truncation. Herein, we propose a low-cost CN processing method to reduce the complexity of CN operations, which take most of the decoding time. Unlike existing studies on low complexity CN operations, the proposed method employs quick selection algorithm, thereby reducing the hardware complexity and CN operation time. The experimental results show that the proposed selection-based CN operation is more than three times faster and achieves better error-correction performance than the conventional EMS algorithm.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 하계종합학술대회 논문집(1)
• /
• pp.323-326
• /
• 2002

In this paper, we study the improved bounds on the performance of low-density parity-check (LDPC) codes over binary-input additive white Gaussian noise (AWGN) channels with belief propagation (BP) decoding in log domain. We define an extended Gallager ensemble based on a new method of constructing parity check matrix and make use of this way to improve upper bound of LDPC codes. At the same time, many simulation results are presented in this paper. These results indicate the extended Gallager ensembles based on Hamming codes have typical minimum distance ratio, which is very close to the asymptotic Gilbert Varshamov bound and the superior performance which is better than the original Gallager ensembles.

• 대한수학회보
• /
• 제57권2호
• /
• pp.459-479
• /
• 2020

In the last two decades, codes over noncommutative rings have been one of the main trends in coding theory. Due to the fact that noncommutativity brings many challenging problems in its nature, still there are many open problems to be addressed. In 2015, generator polynomial matrices and parity-check polynomial matrices of generalized quasi-cyclic (GQC) codes were investigated by Matsui. We extended these results to the noncommutative case. Exploring the dual structures of skew constacyclic codes, we present a direct way of obtaining parity-check polynomials of skew multi-twisted codes in terms of their generators. Further, we lay out the algebraic structures of skew multipolycyclic codes and their duals and we give some examples to illustrate the theorems.

• 대한수학회지
• /
• 제46권1호
• /
• pp.13-30
• /
• 2009

A subset of n tuples of elements of ${\mathbb{Z}}_9$ is said to be a code over ${\mathbb{Z}}_9$ if it is a ${\mathbb{Z}}_9$-module. In this paper we consider an special family of cyclic codes over ${\mathbb{Z}}_9$, namely quadratic residue codes. We define these codes in term of their idempotent generators and show that these codes also have many good properties which are analogous in many respects to properties of quadratic residue codes over finite fields.

• 전자공학회논문지A
• /
• 제33A권2호
• /
• pp.32-39
• /
• 1996

Hybrid decision decoding for the extended hamming codes without retransmission, which is a combination of hard and soft decision decoding, is proposed and its performance is analyzed in this paper. As results, hybsrid decision decoding shows a little bit higher residual bit error rate than soft decision decoding. However, as the size of the extended hamming code increases, the difference of th enumber of comparisons increases further. In addition, hybrid decision decoding shows almost same residual bit error rate as hard decision decoding with retrassmission and shows much lower residual bit error rate than hard decision decoding without retransmission.

• Earthquakes and Structures
• /
• 제25권4호
• /
• pp.235-247
• /
• 2023

Bingöl, a city in eastern Türkiye, is located at a very close distance to the Karlıova Region which is a junction point of the North Anatolian Fault Zone and Eastern Anatolian Fault Zone. By bilateral step over of North Anatolian Fault Zone and Eastern Anatolian Fault Zone each other there occurred NorthWest-SouthEast extended right-lateral and NorthEast-SouthWest extended left-lateral fault zones. In this paper, a typical school building located in Bingöl Çeltiksuyu was selected as the case study. Information on the school building and Bingöl Earthquake (2003) have been given in the paper. This study aimed to determine the fragility curves of the school building according to HAZUS 2022, Turkish Seismic Codes 1998, 2007 and 2018. These codes have been introduced in terms of damage limits. Incremental dynamic analysis is a parametric analysis method that has recently emerged in several different forms to estimate more thoroughly structural performance under seismic loads. Fragility analysis is commonly using to estimate the damage probability of buildings. Incremental Dynamic Analysis have performed, and 1295 Incremental Dynamic Analysis output was evaluated to obtain fragility curves. 20 different ground motion records have been selected with magnitudes between 5.6M and 7.6M. Scaling factors of these ground motions were selected between 0.1g and 2g. Comparison has been made between HAZUS 2022 and Turkish Seismic Codes 1998, 2007 and 2018 in terms of damage states and how they affected fragility curves. TSC 1998 has more conservative strictions along with TSC 2018 than TSC2007 and HAZUS moderate and extensive damage limits.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 하계종합학술대회 논문집(2)
• /
• 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.