• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2005년도 학술대회 논문집 정보 및 제어부문
• /
• pp.406-408
• /
• 2005

A passive Optical Network (PON) is famous for the most cost-efficient solution among the optical networks. This is because there is no active device between a central office and subscribers. A wavelength division multiplexing (WDM) offers each subscriber to feel unlimited bandwidth. A WDM-PON, however, has a cost problem that WDM-PON is used commercially. To solve this trouble, it is surveyed that a Sub-Carrier Multiplexing (SCM) used in a WDM-PON increases the number of subscribers. The performance of WDM/SCM-PON varies with various noises. The several FEC Codes can reduce the effects of noise and improve the performance of the system. Thus, Choosing a suitable FEC code is important work. This paper describes that a Reed-Solomon (RS) code is the most suitable code for WDM/SCM-PON at the object of 100 Mbps and $10^{-9}$ BER

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -1
• /
• pp.552-555
• /
• 2002

Wideband CDMA is one of the radio access technologies for the third generation in which voice is the basic service. There has been lot of research work in order to find out the suitable transmission scheme to meet the requirement of accommodating variable type of services in Wideband-CDMA. This paper studies the behavior of different services using different transmission schemes in Wideband CDU and compares their performance in terms of BER. Different transmission schemes are found to be suitable for different services. Transmission schemes used are- fixed processing gain scheme also called as variable bandwidth scheme, single code transmission and multicode transmission. It is found that fixed processing gain scheme is suitable fur high data rates. Single code transmission is suitable fer low data rates where as multicode transmission is suitable for low and medium data rates.

• ETRI Journal
• /
• 제46권3호
• /
• pp.485-500
• /
• 2024

A hardware architecture is presented to decode (N, K) polar codes based on a low-density parity-check code-like decoding method. By applying suitable pruning techniques to the dense graph of the polar code, the decoder architectures are optimized using fewer check nodes (CN) and variable nodes (VN). Pipelining is introduced in the CN and VN architectures, reducing the critical path delay. Latency is reduced further by a fully parallelized, single-stage architecture compared with the log N stages in the conventional belief propagation (BP) decoder. The designed decoder for short-to-intermediate code lengths was implemented using the Virtex-7 field-programmable gate array (FPGA). It achieved a throughput of 2.44 Gbps, which is four times and 1.4 times higher than those of the fast-simplified successive cancellation and combinational decoders, respectively. The proposed decoder for the (1024, 512) polar code yielded a negligible bit error rate of 10^-4 at 2.7 E_b/N_o (dB). It converged faster than the BP decoding scheme on a dense parity-check matrix. Moreover, the proposed decoder is also implemented using the Xilinx ultra-scale FPGA and verified with the fifth generation new radio physical downlink control channel specification. The superior error-correcting performance and better hardware efficiency makes our decoder a suitable alternative to the successive cancellation list decoders used in 5G wireless communication.

• Journal of applied mathematics & informatics
• /
• 제5권1호
• /
• pp.201-212
• /
• 1998

In the present paper we define the codes which assign D-alphabet one-one codeword to each outcome of a random variable and the functions which represent possible transormations from one-one codes of size D to suitable codes. By using these functions we obtain lower bounds on the exponentiated mean codeword length for one-one codes in terms of the generalized entropy of order $\alpha$ and type $\beta$ and study the particular cases also.

• 대한전자공학회논문지
• /
• 제27권8호
• /
• pp.1221-1230
• /
• 1990

This paper presents a code generation method and an effective handling algorithm of ingeger constant multiplication for RISC machines in compiler design. As RISC Architectures usually use faster and more simply formed instructions than CISC's and most RISC processors do not have an integer multiplication instruction, it is required an effective algorithm to process integer multiplication. For the proposed code generator, Portable C Compiler(PCC) is redesigned to be suitable for an RISC machine, and composed an addition chain is built up to allow fast execution of constant multiplication, a part of integer one whicch appears very frequency in code generation phase.

• 전자공학회논문지CI
• /
• 제49권2호
• /
• pp.134-142
• /
• 2012

본 논문에서는 클라우드 컴퓨팅에 적합한 LDPC 부호 복제 기법을 제안한다. 이를 위해 먼저 파일 가용성과 스토리지 오버헤드 분석을 통해 클라우드 컴퓨팅에 적합한 블록 수와 LDPC 부호 종류를 결정한다. 그리고 LDPC 부호를 정의하는 Tanner 그래프의 무작위 생성 방법과 생성한 LDPC 부호들의 반복적인 복호화 과정을 통한 성능 비교 방법을 제시한다. 또한 실험을 통하여 클라우드 컴퓨팅에 적합한 LDPC 부호 복제 기법의 그래프 정규성과 총 간선 수에 따른 성능 변화를 분석하였다. 이를 통해 LDPC 부호의 그래프 정규성이 좌-정규와 약 좌-정규 일 때와 총 간선 수가 최소이거나 최소에 근접한 값을 가질 때 가장 성능이 좋음을 확인할 수 있었다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2004년도 ICEIC The International Conference on Electronics Informations and Communications
• /
• pp.27-30
• /
• 2004

OFDMA is considered as one of the major candidates for broadband wireless access. The OFDMA signal is usually coherently demodulated, requiring the channel estimation which can be estimated using a known pilot signal. In multi-cell environment, the performance of channel estimation is mainly limited by intercell interference. It is desirable to use a pilot signal that can estimate the channel information robust to the intercell interference in the OFDMA uplink system. In this paper, we consider two types of pilot signal applicable to multi-cell OFDMA uplink systems: One is time-multiplexed pilot signal and the other is code­multiplexed pilot signal. Simulation results show that the code-multiplexed pilot is suitable for low mobility environment and time-multiplexed pilot is suitable for high mobility environment.

• 대한전자공학회논문지
• /
• 제20권5호
• /
• pp.23-30
• /
• 1983

Duobinary 선로부호를 수정하여 "0"의 길이가 제한된 최소 대역폭 선로부호를 설계하였다. 이 새로운 부호는 duobinary와는 달리 "0"기 길이가 제한되어 self-clocking 특성을 가지므로, 수신측의 원활한 동기 재생을 위한 송신측의 데이타 스크램블링이 필요없다. 또한, 눈폭(eye width)과 오판율(error rate) 특성도 duobinary에 버금하며, 전력스펙트럼도 그에 유사하여, optical fiber와 같은 저역통파특성의 선로에 적합하다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2001년도 제14회 신호처리 합동 학술대회 논문집
• /
• pp.959-962
• /
• 2001

Turbo codes of long block sizes have been known to show very good performance in an AWGN channel and the turbo code has been strongly recommended as error correction code for IMT-2000 in 3GPP(3rd Generation Partnership Project). Recently, turbo codes of short block sizes suitable for real time communication systems have attracted a lot of attention. Thus, in this paper we consider the turbo code of 1/3 code rate and short frame size of 192 bits in ITU-R channel model. We analyzed the performance of W-CDMA systems of 10MHz bandwidths employing RAKE receiver with not only MRC diversity but also turbo code.

• ETRI Journal
• /
• 제30권3호
• /
• pp.394-402
• /
• 2008

Domain analysis is the process of analyzing related software systems in a domain to find their common and variable parts. In the case of device drivers, they are highly suitable for domain analysis because device drivers of the same domain are implemented similarly for each device and each system that they support. Considering this characteristic, this paper introduces a new approach to the domain analysis of device drivers. Our method uses a code clone detection technique to extract similarity among device drivers of the same domain. To examine the applicability of our method, we investigated whole device drivers of a Linux source. Results showed that many reusable similar codes can be discerned by the code clone detection method. We also investigated if our method is applicable to other kernel sources. However, the results show that the code clone detection method is not useful for the domain analysis of all kernel sources. That is, the applicability of the code clone detection method to domain analysis is a peculiar feature of device drivers.