• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.3C
• /
• pp.329-340
• /
• 2009

This paper proposes a novel code tracking scheme to track the fine code synchronization for BOC(pn,n) modulated spreading signals. The correlation function of BOC(pn,n) modulated spreading signals has been several peaks. In this paper, we observe that the correlation function in the advanced offset region remains almost unchanged, due to the multipath signals being received later than a line-of-sight signal. Based on this observation, we propose a novel code tracking scheme which is called the advanced region correlation (ARC) method for BOC(n,n) modulated spreading signals. And, we compare with the code tracking accuracy between the conventional and proposed methods in the static multipath and land mobile satellite system channels through the Monte-Carlo simulation. Then, base on the proposed scheme, we propose the generalized-ARC (ARC) scheme for BOC(pn, n) modulated spreading signals.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.15 no.6
• /
• pp.492-505
• /
• 2022

This study is a study on the results of improving the logic to effectively transmit and decode compressed data in real time by improving the encoding and decoding performance of BL-beta codes that can be used for lossless real-time transmission of IoT sensing data. The encoding process of BL-beta code includes log function, exponential function, division and square root operation, etc., which have relatively high computational burden. To improve them, using bit operation, binary number pattern analysis, and initial value setting of Newton-Raphson method using bit pattern, a new regularity that can quickly encode and decode data into BL-beta code was discovered, and by applying this, the encoding speed of the algorithm was improved by an average of 24.8% and the decoding speed by an average of 5.3% compared to previous study.

• Journal of electromagnetic engineering and science
• /
• v.6 no.4
• /
• pp.244-252
• /
• 2006

A block Jacket transform and. its block inverse Jacket transformn have recently been reported in the paper 'Fast block inverse Jacket transform'. But the multiplication of the block Jacket transform and the corresponding block inverse Jacket transform is not equal to the identity transform, which does not conform to the mathematical rule. In this paper, new binary block Jacket transforms and the corresponding binary block inverse Jacket transforms of orders $N=2^k,\;3^k\;and\;5^k$ for integer values k are proposed and the mathematical proofs are also presented. With the aid of the Kronecker product of the lower order Jacket matrix and the identity matrix, the fast algorithms for realizing these transforms are obtained. Due to the simple inverse, fast algorithm and prime based $P^k$ order of proposed binary block inverse Jacket transform, it can be applied in communications such as space time block code design, signal processing, LDPC coding and information theory. Application of circular permutation matrix(CPM) binary low density quasi block Jacket matrix is also introduced in this paper which is useful in coding theory.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.5
• /
• pp.1766-1784
• /
• 2014

Finger vein images contain rich oriented features. Local line binary pattern (LLBP) is a good oriented feature representation method extended from local binary pattern (LBP), but it is limited in that it can only extract horizontal and vertical line patterns, so effective information in an image may not be exploited and fully utilized. In this paper, an orientation-selectable LLBP method, called generalized local line binary pattern (GLLBP), is proposed for finger vein recognition. GLLBP extends LLBP for line pattern extraction into any orientation. To effectually improve the matching accuracy, the soft power metric is employed to calculate the matching score. Furthermore, to fully utilize the oriented features in an image, the matching scores from the line patterns with the best discriminative ability are fused using the Hamacher rule to achieve the final matching score for the last recognition. Experimental results on our database, MMCBNU_6000, show that the proposed method performs much better than state-of-the-art algorithms that use the oriented features and local features, such as LBP, LLBP, Gabor filter, steerable filter and local direction code (LDC).

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.3
• /
• pp.357-362
• /
• 2005

Iris recognition system is the one of the most reliable biometries recognition system. An algorithm is proposed to determine the localized iris from the iris image received from iris input camera in client. For the first step, the algorithm determines the center of pupil. For the second step, the algorithm determines the outer boundary of the iris and the pupillary boundary. The localized iris area is transformed into polar coordinates. After performing three times Wavelet transformation, normalization was done using a sigmoid function. The converting binary process performs normalized value of pixel from 0 to 255 to be binary value, and then the converting binary process is compared pairs of two adjacent pixels. The binary code of the iris is transmitted to the server by the network. In the server, the comparing process compares the binary value of presented iris to the reference value in the database. The process of recognition or rejection is dependent on the value of Hamming Distance. After matching the binary value of presented iris with the database stored in the server, the result is transmitted to the client.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.10
• /
• pp.1074-1080
• /
• 1992

A(5,8) block binary line code is proposed. The new line code called MB58 has the properties of being dc-free and runlength-limited, and it is strictly bandwidth-limited to the Nyquist frequency, such that bandwidth efficiency is improved. This new code is a memoryless code with a simple decoding rule and capability of error monitoring. The power spectrum and the eye pattern of the new code are obtained by simulation, wherein spectral nulls at DC(f=0) and Nyquist frequency (f=1/2Ts) are clearly identified.

• Review of KIISC
• /
• v.5 no.2
• /
• pp.26-31
• /
• 1995

본 논문에서는 다항식 환 k($x_1$,…, $x_n$)에서의 Grobner bases 개념과 응용을 소개하고 있다. 특히 Grobner bases를 이용한 binary cyclic code에 대한 효율적인 algebraic decoding method를 자세히 설명하고 있다.

• Proceedings of the Korea Contents Association Conference
• /
• 2003.11a
• /
• pp.303-307
• /
• 2003

In this paper, the W(ultra widebend) system is used for high speed transmission applying BPSK(Binary Phase Shift Keying) and QPSK (Quadrature Phase Shift Keying), and utilizing the convolution coding with code rate, 1/2 and constraint length, K=7 in order to reduce the bit error rate. And the performance of system is analyzed in the AWGN(Additive White Gaussian Noise) channel environment by using the Viterbi decoding algorithm and adopting the time-hopping sequence as a multiple access method in order to avoid the multiuser interference.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.12 no.3
• /
• pp.159-167
• /
• 2017

Software safety is a key issue in embedded system of automotive and aviation industries. Various software testing approaches have been proposed to achieve software safety like ISO26262 Part 6 in automotive environment. In spite of one of the classic and basic approaches, stack memory is hard to estimating exactly because of uncertainty of target code generated by compiler and complex nested interrupt. In this paper, we propose an approach of analyzing the maximum stack usage statically from target binary code rather than the source code that also allows nested interrupts for determining the exact stack memory size. In our approach, determining maximum stack usage is divided into three steps: data extraction from ELF file, construction of call graph, and consideration of nested interrupt configurations for determining required stack size from the ISR (Interrupt Service Routine). Experimental results of the estimation of the maximum stack usage shows proposed approach is helpful for optimizing stack memory size and checking the stability of the program in the embedded system that especially supports nested interrupts.

• Journal of Positioning, Navigation, and Timing
• /
• v.13 no.1
• /
• pp.1-13
• /
• 2024

In this paper, we investigate the signal design of six (USA, EU, Russia, China, Japan, and India) countries for Global Navigation Satellite Systems (GNSS). Recently, a navigation satellite system that is capable of high-precision and reliable Positioning, Navigation, Timing (PNT) services has been developed. Prior to system design, a survey of the signal design for other GNSS systems should precede to ensure compatibility and interoperability with other GNSS. The signal design includes carrier frequency, Pseudorandom Noise (PRN) code, modulation, navigation service, etc. Specifically, GNSS is allocated L1, L2, and L5 bands, with recent additions of the L6 and S bands. GNSS uses PRN code (such as Gold, Weil, etc) to distinguish satellites that transmit signals simultaneously on the same frequency band. For modulation, both Binary Phase Shift Keying (BPSK) and Binary Offset Carrier (BOC) have been widely used to avoid collision in the frequency spectrum, and alternating BOCs are adopted to distinguish pilot and data components. Through the survey of other GNSS' signal designs, we provide insights for guiding the design of new satellite navigation systems.