• 한국정보통신설비학회:학술대회논문집
• /
• 2009.08a
• /
• pp.309-313
• /
• 2009

In this paper, the network performance of a turbo coded optical code division multiple access (CDMA) system with cross-layer, which is between physical and network layers, concept is analyzed and simulated. We consider physical and MAC layers in a cross-layer concept. An intensity-modulated/direct-detection (IM/DD) optical system employing pulse position modulation (PPM) for satellite broadcasting communications is considered. In order to increase the system performance, turbo codes composed of parallel concatenated convolutional codes (PCCCs) is utilized. The network performance is evaluated in terms of bit error probability (BEP). From the simulation results, it is demonstrated that turbo coding offers considerable coding gain with reasonable encoding and decoding complexity. Also, it is confirmed that the performance of such an optical CDMA network can be substantially improved by increasing the interleaver length and the number of iterations in the decoding process. The results of this paper can be applied to implement the satellite broadcasting communications.

• 한국정보통신설비학회:학술대회논문집
• /
• 2009.08a
• /
• pp.314-319
• /
• 2009

In this paper, the network performance of a turbo coded optical code division multiple access (COMA) system with cross-layer, which is between physical and network layers, concept is analyzed and simulated We consider physical and MAC layers in a cross-layer concept. An intensity-modulated/direct-detection (IM/DD) optical system employing pulse position modulation (PPM) is considered In order to increase the system performance, turbo codes composed of parallel concatenated convolutional codes (PCCCs) is utilized. The network performance is evaluated in terms of bit error probability (BEP). From the simulation results, it is demonstrated that turbo coding offers considerable coding gain with reasonable encoding and decoding complexity. Also, it is confirmed that the performance of such an optical COMA network can be substantially improved by increasing the interleaver length and the number of iterations in the decoding process. The results of this paper can be applied to implement the indoor optical wireless LANs.

• Journal of the Institute of Convergence Signal Processing
• /
• v.11 no.3
• /
• pp.226-231
• /
• 2010

This paper proposes a new coding technique for constructing error correcting high rate DC-free multimode code using a generator matrix generated from a sparse parity-check matrix. The scheme exploits high rate generator matrixes for producing distinct candidate codewords. The decoding complexity depends on whether the syndrome of the received codeword is zero or not. If the syndrome is zero, the decoding is simply performed by expurgating the redundant bits of the received codeword. Otherwise, the decoding is performed by a sum-product algorithm. The performance of the proposed scheme can achieve a reasonable DC-suppression and a low bit error rate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7A
• /
• pp.1005-1015
• /
• 1999

This paper is concerned with an improvement on IFFT (inverse fast Fourier transform) and FFT based baseband digital implementation algorithm for BPSK (binary phase shift keying)-modulated MC-CDMA (multicarrier-code division multiple access) systems, that is functionally equivalent to the conventional implementation algorithm, while reducing computational complexity and bandwidth requirement. We also derive an equalizer structure for the proposed implementation algorithm. The proposed algorithm is based on a variant of FFT algorithm that utilizes a N/2-point FFT/IFFT for simultaneous transformation and reconstruction of two N/2-point real signals. The computer simulations under additive white Gaussian noise channels and frequency selective fading channels using equal gain combiner and maximal ratio combiner diversities, demonstrate the performance of the proposed algorithm.

• Journal of electromagnetic engineering and science
• /
• v.11 no.4
• /
• pp.239-249
• /
• 2011

In this paper, we propose a reliable $8{\times}8$ up-down switching polar relay code based on 3GPP LTE standard, motivated by 3GPP LTE down link, which is 30 bps/Hz for $8{\times}8$ MIMO antennas, and by Arikan's channel polarization for the frequency selective fading (FSF) channels with the generator matrix $Q_8$. In this scheme, a polar encoder and OFDM modulator are implemented sequentially at both the source node and relay nodes, the time reversion and complex conjugation operations are separately implemented at each relay node, and the successive interference cancellation (SIC) decoder, together with the cyclic prefix (CP) removal, is performed at the destination node. Use of the scheme shows that decoding at the relay without any delay is not required, which results in a lower complexity. The numerical result shows that the system coded by polar codes has better performance than currently used designs.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.5
• /
• pp.29-36
• /
• 2009

Cost and Time for software test is gradually increasing as the software complexity increases. To cope with this problem, it is very important to reduce the number of test cases used in the software test. The interaction strength number is especially important in decision of the number of test cases for the unit test, where the interaction strength number means the number of arguments which affect the results of a function by the analysis of their combination used in source code of the function. This paper proposes the algorithm that computes the number of the interaction strength, where analyzes the patterns used in the source code of a function and increase its number when the pattern matches one of the specified patterns. The proposed algorithm is validated by some experiments finding coverage and the number of fault detection.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.3A
• /
• pp.207-213
• /
• 2006

In this paper, we reduce the computational complexity to find the minimum distance of RA codes by searching only valid codewords using repetition part. Since LDPC codes have repetition part like RA codes, we also apply this algorithm for computing the minimum distance of LDPC codes. The minimum distance dominates the code performance at high signal-to-noise ratios(SNRs) and in turn allows an estimate of the error floor. The proposed algorithm computes the minimum distance without any constraint on code structures. The minimum distances of LDPC codes and RA codes with large interleavers of practical importance are computed and used to obtain the error floor, which is compared with the performance of the iterative decoding.

• Journal of Electrical Engineering and Technology
• /
• v.12 no.3
• /
• pp.1262-1270
• /
• 2017

Among various decoding algorithms of low-density parity-check (LDPC) codes, the min-sum (MS) algorithm and its modified algorithms are widely adopted because of their computational simplicity compared to the sum-product (SP) algorithm with slight loss of decoding performance. In the MS algorithm, the magnitude of the output message from a check node (CN) processing unit is decided by either the smallest or the next smallest input message which are denoted as min1 and min2, respectively. It has been shown that multiplying a scaling factor to the output of CN message will improve the decoding performance. Further, Zhong et al. have shown that multiplying different scaling factors (called a 2-dimensional scaling) to min1 and min2 much increases the performance of the LDPC decoder. In this paper, the simplified 2-dimensional scaled (S2DS) MS algorithm is proposed. In the proposed algorithm, we figure out a pair of the most efficient scaling factors which multiplications can be replaced with combinations of addition and shift operations. Furthermore, one scaling operation is approximated by the difference between min1 and min2. The simulation results show that S2DS achieves the error correcting performance which is close to or outperforms the SP algorithm regardless of coding rates, and its computational complexity is the lowest comparing to modified versions of MS algorithms.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2
• /
• pp.536-541
• /
• 2000

Turbo code has excellent decoding performance but had limitations for real time communications because of the system complexity and time delay in decoding procedure. To overcome this problem, a new SRI(Semi-Random Interleaver) algorithm which realize the reduction of the interleaver size is proposed for reducing the time delay during the decoding prodedure. SRI compose the interleaver 0.5 size from the input data sequence. In writing the interleaver, data is recorded by row such as block interleaver. But, in reading, data is read by randomly and the text data is located by the just address simultaneously. Therefore, the processing time of with the preexisting method such as block, helical random interleaver.

• The Journal of Information Technology
• /
• v.9 no.1
• /
• pp.65-79
• /
• 2006

e-Marketplace is a business concept which is importantly considered in the area of marketing. e-Marketplace provides the public field in which multi-purchasers can efficiently trade with multi-suppliers. Supply Chain Management(SCM) is being widely acknowledged by the development of information technology. SCM is well known as one of the key issues lately. The complexity of supply chains and the associated potential opportunities for gaining a competitive edge by designing a product and process to support supply chain management can be significant. In order to achieve successful implementation of supply chain management system, companies should understand some barriers in implementation and set up effective and integrated information system. Standardization of logistics is needed through the unification of EDI, Bar Code, Pallet and so on. It's effect is magnified on Efficient Consumer Response such as efficient store assortment, efficient replenishment, efficient promotion and efficient product introduction. International logistics management is the integration of key business processes from original suppliers to end user that provides products, services and information that add value for customers. e-Logistics is being used in managing the international logistics. In this study, three basic e-SCM models for the strategic implementation of supply chain management are suggested. Among them, the virtual company can be the best one we can develop in order to cope with the individualized customer needs.