• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• 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

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• 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
• /
• v.46 no.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
• /
• v.5 no.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.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.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.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.49 no.2
• /
• pp.134-142
• /
• 2012

This paper analyze an LDPC code replication method suitable for cloud computing. First, we determine the number of blocks suitable for cloud computing through analysis of the performance for the file availability and storage overhead. Also we determine the type of LDPC code appropriate for cloud computing through the performance for three types of LDPC codes. Finally we present the graph random generation method and the comparing method of each generated LDPC code's performance by the iterative decoding process. By the simulation, we confirmed the best graph's regularity is left-regular or least left-regular. Also, we confirmed the best graph's total number of edges are minimum value or near the minimum value.

• Proceedings of the IEEK Conference
• /
• summer
• /
• 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.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.20 no.5
• /
• pp.23-30
• /
• 1983

A new runlength-limited minimum-bandwidth line code is designed by modifying the duobinary code. Since the new code is runlength limited, the need for a data scrambling before transmission is eliminated. The eye width and the error probability of the new code are shown to be almost the same as those of the duobinary code. Also, the power spectral shape is scarcely changed, so that the new code is suitable for such low-pass channels as optical fibers.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• 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
• /
• v.30 no.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.