• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.2
• /
• pp.1-8
• /
• 1990

The unequal bit-error control of rate r=b/n binary convolutional code is analyzed. The error protection afforded to each digit of the viterbi decoded b-tuple information word can be different from that afforded to other digit. The property of the unequal protection can be applied for improvement of SNR in transmitting sampled data of DPCM system.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.2019-2022
• /
• 2002

This paper presents design of spreading codes for asynchronous DS-CDMA systems. We have been trying to generate maximal-period sequences based on one-dimensional maps with finite bits whose shapes are similar to piecewise linear chaotic maps. We propose an efficient search algorithm finding such mammal-period sequences. This algorithm makes it possible to find many kinds of maximal-period sequences with sufficiently long period for CDMA applications. We also investigate bit error rate(BER) in asynchronous DS-CDMA systems using the maximal-period binary sequences by computer simulations.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.49-50
• /
• 2006

Digital satellite systems are usually integrated with terrestrial systems to provide various services, and in these cases they should satisfy the performance objectives defined by the terrestrial systems. Recommendation ITU-R S.1062 specifies the performance of digital satellite systems. The performance objectives were given in terms of bit error probability divided by the average number of errors per burst versus percentage of time. This paper presents theoretical method to estimate performance measure of digital satellite systems defined in Recommendation ITU-R S.1062. We show performance estimation results of duo-binary Turbo codes, and verify them by comparing to the simulation results.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.10
• /
• pp.100-112
• /
• 1992

In this paper, an integrated document input/output system is developed which constructs the graphic document from a text file, converts the document into encoded facsimile data, and also recognizes printed/handwritten alphanumerics and Korean characters in a facsimile or graphic document. For an output system, we develop the method which generates bit-map patterns from the document consisting of the KSC5601 and ASCII codes. The binary graphic image, if necessary, is encoded by the G3 coding scheme for facsimile transmission. For a user friendly input system for documents consisting of alphanumerics and Korean characters obtained from a facsimile or scanner, we propose a document recognition algirithm utilizing several special features(partial projection, cross point, and distance features) and the membership function of the fuzzy set theory. In summary, we develop an integrated document input/output system and its performance is demonstrated via computer simulation.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.62 no.1
• /
• pp.127-132
• /
• 2013

In this paper, we design the physical layer of Guardian modem for wireless public networks. The physical layer is composed of a dual-band RF (Radio Frequency) transceiver and a baseband-processor with quasi-orthogonal codes. The 2.4/5GHz dual-band RF transceiver can overcome the communication difficulty of dense 2.4GHz band for wireless public environment. Also the quasi-orthogonal code can reduce the required ASIC (Application Specific Integrated Circuit) design area. Finally, we analyze the performance of the developed system in viewpoint of data rate, BER (Bit Error Rate), PER (Packet Error Rate). Moreover we verify the performance of the dual-band RF communication.

• Proceedings of the KIEE Conference
• /
• summer
• /
• pp.327-329
• /
• 2004

전력선통신(PLC : Power Line Communication)은 실제 네트워크를 작성할 수 있는 이점은 있지만 이로 인해서 말단의 망 구성이 복잡해지고 여러 부하 장치들의 사용과 운용이 시간과 공간에 따라 전송 특성이 수시로 가변 하는 특성을 가지게 된다. 이러한 특성은 통신시스템 성능상의 다중 경로페이딩의 지연과 성분을 가지게 되므로, 열악한 통신 채널 환경 띤 다중 사용자 간섭에 의한 원인이 된다. 본 논문에서는 이런 원인을 극복하기 위한 한 가지방편으로서, 저간섭 전력선 통신에 적용 가능한 이진 ZCD 확산 코드를 제시하고, 상관 특성을 도출해 봄으로서, 그 유효성을 확인한다.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.23 no.3
• /
• pp.295-308
• /
• 1986

This paper presents a method of constructing multiple-valued logic functions based on Galois field. The proposed algorithm assigns all elements in GF(2**m) to bit codes that are easily converted binary. We have constructed an adder and a multiplier using a multiplexer after bit code operation (addition, multiplication) that is performed among elements on GF(2**m) obtained from the algorithm. In constructing a generalized multiple-valued logic functions, states are first minimized with a state-transition diagram, and then the circuits using PLA widely used in VLSI design for single and multiple input-output are realized.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.10
• /
• pp.2615-2628
• /
• 1997

In this paper, a new codebook design algorithm is proposed. It uses a DCT map based on two-dimensional discrete cosine of transform (2D DCT) and finite state vector quantizer (FSVQ) when the vector quantizer is designed for image transmission. We make the map by dividing input image according to edge quantity, then by the map, the significant features of training image are extracted by using the 2D DCT. A master codebook of FSVQ is generated by partitioning the training set using binary tree based on tree-structure. The state codebook is constructed from the master codebook, and then the index of input image is searched at not master codebook but state codebook. And, because the coding of index is important part for high speed digital transmission, it converts fixed length codes to variable length codes in terms of entropy coding rule. The huffman coding assigns transmission codes to codes of codebook. This paper proposes single-side growing huffman tree to speed up huffman code generation process of huffman tree. Compared with the pairwise nearest neighbor (PNN) and classified VQ (CVQ) algorithm, about Einstein and Bridge image, the new algorithm shows better picture quality with 2.04 dB and 2.48 dB differences as to PNN, 1.75 dB and 0.99 dB differences as to CVQ respectively.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.10
• /
• pp.14-27
• /
• 2009

Polar Code was proposed by Turkish professor Erdal Arikan in 2006 as an idea that splitted input channel is increasing the cutoff rate. The channel polarization consisted of code sequences with symmetric high rate capacity in a given B-DMC(Binary-input Discrete Memoryless Channel) W. The symmetric capacity is the highest rate achievable subject to using the input letters of the channel with equal probability. The channel polarization is said to a set of given N independent outputs of B-DMC W. In other word, N increases when N is a set of binary-input channels {$W^{(i)}_N\;:\;1{\leq}\;i\;{\leq}\;N$}, in I{WN(i)} as the fraction of indices is near to 1, which is approaching to I(W), and it is near to 0, then to 1-I(W), where I(W) presents high rates in reliable wireless communication channel as inputs of W with equal frequences. After all, {WN(i)} is shown to be a state of channel coding. On the based on this Polar codes, this paper analyzes Polar coding and decoding of Arikan and propose Radix4 Polar coding newly.

• Journal of KIISE
• /
• v.43 no.10
• /
• pp.1067-1072
• /
• 2016

Software birthmarks, which are unique characteristics of the software, are used to detect software plagiarism or software similarity. Generally, software birthmarks are divided into static birthmarks or dynamic birthmarks, which have evident pros and cons depending on the extraction method. In this paper, we propose a method for extracting the API sequence birthmarks using a dynamic analysis and similarity detection between the executable codes. Dynamic birthmarks based on API sequences extract API functions during the execution of programs. The extracted API sequences often include all the API functions called from the start to the end of the program. Meanwhile, our dynamic birthmark scheme extracts the API functions only called directly from the executable code. Then, it uses a sequence alignment algorithm to calculate the similarity metric effectively. We evaluate the birthmark with several open source software programs to verify its reliability and credibility. Our dynamic birthmark scheme based on the extracted API sequence can be utilized in a similarity test of executable codes.