• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.5
• /
• pp.185-192
• /
• 2011

In this paper, we simulate and analyze performance of iterative coding scheme, double binary turbo code, for high speed power line communication (PLC) systems. PLC system has hostile environment for high speed data transmission, so error correction method is necessary to compensate effects of PLC channel. We employ the PLC model proposed by M. Zimmerman and Middleton Class A interference model, and system performance is evaluated in terms of bit error rate (BER). From the simulation results, we confirm double binary turbo code provides considerable coding gains to PLC system and BER performance is significantly improved as the number of iteration increase. It is also confirmed that BER performance increases as code rate is lager, while it decreases as the code rate is smaller.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.2
• /
• pp.263-269
• /
• 2012

Code-Division Multiple-Access(CDMA) allows several users simultaneous access to a common channel by assigning a distinct pseudonoise sequence called spectrum code to each user. Each user in a CDMA system uses a assigned spectrum code to modulate their signal. Choosing the codes used to modulate the signal is very important in the performance of CDMA systems. The best performance will occur when there is good separation between the signal of a desired user and the signals of other users. The receiver synchronizes the code to recover the data. The use of an independent code allows multiple users to access the same frequency band at the same time. In this paper we propose a generalized model of non-linear binary sequence using trace function and analyze cross-correlation of these sequences. These sequences with low correlation, large linear span and large family size, in a direct-sequence spread spectrum communication system, help to minimize multiple access interference, increase security degree of system and enlarge user number.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.4
• /
• pp.1807-1823
• /
• 2016

Local Binary Pattern (LBP) and its variants have powerful discriminative capabilities but most of them just consider each LBP code independently. In this paper, we propose sub oriented histograms of LBP for smoke detection and image classification. We first extract LBP codes from an image, compute the gradient of LBP codes, and then calculate sub oriented histograms to capture spatial relations of LBP codes. Since an LBP code is just a label without any numerical meaning, we use Hamming distance to estimate the gradient of LBP codes instead of Euclidean distance. We propose to use two coordinates systems to compute two orientations, which are quantized into discrete bins. For each pair of the two discrete orientations, we generate a sub LBP code map from the original LBP code map, and compute sub oriented histograms for all sub LBP code maps. Finally, all the sub oriented histograms are concatenated together to form a robust feature vector, which is input into SVM for training and classifying. Experiments show that our approach not only has better performance than existing methods in smoke detection, but also has good performance in texture classification.

• Journal of the Korea Society for Simulation
• /
• v.17 no.1
• /
• pp.17-22
• /
• 2008

Double-binary turbo code has been adopted as an error control code of various future communication systems including wireless metropolitan area networks(WMAN) due to its powerful error correction capability. One of the components affecting the performance of turbo code is internal interleaver. In 802.16 d/e system, an almost regular permutation(ARP) interleaver has been included as a part of specification, however it seems that the interleaver is not optimized in terms of decoding performance. In this paper, we propose three optimization methods for the interleaver based on spatial distance, spread and minimum distance between original and interleaved sequence. We find optimized interleaving parameters for each optimization method and evaluate the performances of the proposed methods by computer simulation under additive white Gaussian noise(AWGN) channel. Optimized parameters can provide up to 1.0 dB power gain over the conventional method and furthermore the obtainable gain does not require any additional hardware complexity.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.10
• /
• pp.11-18
• /
• 1998

A binary line code, called MB46d, is designed by use of the BUDA(Binary Unit DSV and ASV) cell concept to retain the property of being runlength limited, DC tree, and with a power spectral null at the Nyquist frequency. This new code is a stateless line code with a simple encoding and a decoding rule and enables efficient error monitoring. The power spectrum and the eye pattern of the new line code are simulated for a minimum-bandwidth digital transmission system where the sinc function is used as a basic pulse. The obtained power null at the Nyquist frequency is wide enough to enable easy band-limiting as well as secure insertion of a clock pilot where necessary. The eye is also substantially wide to tolerate a fair amount of timing jitter in the receiver.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.10
• /
• pp.1-10
• /
• 1998

It is important to know phase offsets of a spreading code in the code division multiple access(CDMA) mobile communication systems because different phase offsets of the same spreading code are used to distinguish each base station. When the period of the code is not that long, the relative phase offset between the code and its shifted code can be found by comparing them, but as the period of the code increases it becomes difficult to find the phase offset. This paper describes a method to calculate the phase offset of a binary code based on the number theoretical approach. We define an accumulator function which plays a central role in this paper, and relationships between the functions are clarified. This number theoretical approach and their results show that this method is very easy for the phase offset calculation. Its application to the CDMA system and circuit realization of the phase offset calculation are also discussed.

• Journal of the Korean Mathematical Society
• /
• v.39 no.2
• /
• pp.289-317
• /
• 2002

We associate binary codes to polynomials over fields of characteristic two and show that the binary Golay codes are associated to the Mathieu group polynomials in characteristics two. We give two more polynomials whose Galois group in $M_{12}$ but different self-orthogonal binary codes are associated. Also, we find a family of $M_{24}$-coverings which includes previous ones.

• The Proceeding of the Korean Institute of Electromagnetic Engineering and Science
• /
• v.13 no.4
• /
• pp.13-24
• /
• 2002

CDMA 시스템은 성능의 우수성에도 불구하고 신호처리의 복잡성과, 여러 채널의 신호를 동시에 전송시, 채널수가 증가할수록 신호의 PAPR(Peak to Average Power Ratio)가 증가하는 문제점을 갖고 있다. 본 논문에서는 멀티코드 CDMA의 특성과 구조를 유지하면서도 전송신호의 레벨이 항상 일정하여 기존의 TDMA 시스템 구조로도 멀티코드 CDMA 신호를 전송할 수 있는 Binary CDMA 기술에 대해 소개한다. Binary CDMA 기술은 적용 기술별로는 펄스폭 CDMA(PW/CDMA; Pulse Width CDMA), 다위상 CDMA(MP/CDMA; Multi Phase CDMA), 코드선택 CDMA(CS/CDMA; Code Select CDMA)로 구분되며, 사용자간의 상호간섭이 심한 환경에서 무선으로 실시간 멀티미디어를 보내는 소형 휴대형 장비에 적합한 무선 solution을 제공한다.

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1375-1378
• /
• 1987

In this paper, an efficient data compression algorithm for binary image is proposed. This algorithm makes use of the fact that boundaries contain all the information about such images. The compression efficiency is then further increased by efficient coding of Boundary Information Matrix. The comparison of performance with modified Huffman coding was made by a computer simulation with some images. The results of simulation showed that the proposed algorithm was more efficient than modified Huffman code.

• Journal of applied mathematics & informatics
• /
• v.16 no.1_2
• /
• pp.105-113
• /
• 2004

An open problem proposed by Safavi-Naini and Seberry in IEEE transactions on information theory(1991) can be reduced to a combinatorial problem on partitioning a subset of binary matrices. We solve the generalized Naini-Seberry's open problem by considering a certain class of binary matrices. Thus a subliminal channel of r 〉 1 bit capacity is systematically established for Naini-Seberry's authentication schemes. We also construct concrete examples.