• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.6C
• /
• pp.656-663
• /
• 2009

Recently, frequency offset estimation method for orthogonal frequency division multiplexing has been proposed by Ren et al. (REA). The method can estimate an frequency offset independently from training symbol structure. In REA method, however, the detection probability of integer frequency offset is varying according to fractional frequency offset. In this paper, we first analysis REA frequency offset estimation method, and define new detection criteria suitable for the method. Then, we propose efficient integer frequency offset estimation method based on the new detection criteria and maximum likelihood method. The proposed method still has the advantages of REA method, while overcome the drawback. The numerical results demonstrate that the proposed methods outperform the REA method, in terms of integer frequency offset detection probability.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.6A
• /
• pp.592-598
• /
• 2008

In this paper, a novel pilot-aided integer frequency offset estimation scheme is proposed for orthogonal Sequency division multiplexing (OFDM)-based digital video broadcasting (DVB) systems. The conventional pilot-aided integer frequency offset estimation scheme proposed for OFDM-based DVB systems exploits the partial information of combinations provided by pilots. Thus, in this paper, we propose a novel integer frequency offset estimation scheme exploiting all information of pilot combinations. To compare the performance of the proposed scheme with that of the conventional scheme, we conduct a simulation in additive white Gaussian noise (AWGN) and multipath Rayleigh channels, which shows that the proposed scheme outperforms the conventional scheme in terms of the probability of integer frequency offset estimation failure.

• IE interfaces
• /
• v.21 no.2
• /
• pp.170-176
• /
• 2008

Consider a multi-floor facility with multiple rooms of unequal size on each floor. Students come from many organizations to attend the conference to be held at this facility. In assigning the rooms to the students, several constraints must be met; such as boys and girls must not be assigned to the rooms on the same floor. Given the capacity of each room and the number of students from each organization, the problem is assigning students to rooms under a set of constraints and various objectives. We present six models with different objective functions; and formulate them as binary integer programming problems. A numerical example and a case study follow to illustrate the proposed models.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.6 no.3
• /
• pp.223-231
• /
• 2006

In high-speed fuzzy control systems applied to intelligent systems such as robot control, one of the most important problems is the improvement of the execution speed of the fuzzy inference. In particular, it is more important to have high-speed operations in the consequent part and the defuzzification stage. To improve the speedup of fuzzy controllers for intelligent systems, this paper presents an integer line mapping algorithm to convert [0, 1] real values of the fuzzy membership functions in the consequent part to a $400{\times}30$ grid of integer values. In addition, this paper presents a method of eliminating the unnecessary operations of the zero items in the defuzzification stage. With this representation, a center of gravity method can be implemented with only integer additions and one integer division. The proposed system is analyzed in the air conditioner control system for execution speed and COG, and applied to the truck backer-upper control system. The proposed system shows a significant increase in speed as compared with conventional methods with minimal error; simulations indicate a speedup of an order of magnitude. This system can be applied to real-time high-speed intelligent systems such as robot arm control.

• Journal of the Korean Institute of Navigation
• /
• v.22 no.4
• /
• pp.15-19
• /
• 1998

This paper concerns a bulk or semibulk cargo ship scheduling problem with a single loading port. This type of ship scheduling problem is frequently needed in real world for carrying minerals or agricultural produce from a major single production zone to many destinations scattered over a large area of the world. The first optimization model for this problem was introduced by Ronen (1986) as a nonlinear mixed integer program. The model developed in this paper is an improvement of his model in the sense that nonlinearities and numerous unnecessary integer variables have been eliminated. By this improvement we could expect real world instances of moderate sizes to be solved optimal solutions by commercial integer programming software. Similarity between the ship scheduling model and the capacitated facility location model is also discussed.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.3
• /
• pp.637-647
• /
• 2010

This paper suggested an algorithm that uses a multiplier, 'w bit $\times$ w bit = 2w bit', to process $\frac{N}{D}$ integer division of 2w bit integer N and w bit integer D. An algorithm suggested of the research, when the divisor D is '$D=0.d{\times}2^L$, 0.5 < 0.d < 1.0', approximate value of $\frac{1}{D}$, '$1.g{\times}2^{-L}$', which satisfies '$0.d{\times}1.g=1+e$, e < $2^{-w}$', is defined as over reciprocal number and the dividend N is segmented in small word more than 'w-3' bit, and partial quotient is calculated by multiplying over reciprocal number in each segmented word, and quotient of double precision integer division is evaluated with sum of partial quotient. The algorithm suggested in this paper doesn't require additional correction, because it can calculate correct reciprocal number. In addition, this algorithm uses only multiplier, so additional hardware for division is not required to implement microprocessor. Also, it shows faster speed than the conventional SRT algorithm. In conclusion, results from this study could be used widely for implementation SOC(System on Chip) and etc. which has been restricted to microprocessor and size of the hardware.

• Journal of Navigation and Port Research
• /
• v.34 no.1
• /
• pp.59-64
• /
• 2010

This study is to determine an optimal marina's construction location candidate among many alternative candidates in order to obtain the maximized efficiency under the natural conditions. To deal with marina's construction location, the optimal construction location is selected using 10 important factor analysis for 10 candidates in Yeosu city. In this paper, the new model to assign the most reasonable alternative is introduced using 0-1 integer programming. This proposed model has not been applied in the optimal marina's facility candidate selection problem yet. This paper will contribute to determine the most reasonable alternative. Also, this proposal model can be applied to other marina's facility candidate selection problem in other regions.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.05a
• /
• pp.394-401
• /
• 2003

We consider a PCB grouping problem arising from the electronic industry. Given a surface mounting device, several types of PCBs and a number of component feeders used to assemble the PCBs. the optimization problem is the PCB grouping problem while minimizing setup time of component feeders. We formulate the problem as an Integer programming model and propose a column generation approach to solve the Integer programming formulation. In this approach we decompose the original problem Into master problem and column generation subproblem Starting with a few columns in the master problem. we generate new columns successively by solving subproblem optimally. To solve the subproblem. we use a branrh-and-rut approach. Computational experiments show that our solution approach gives high quality solutions in a reasonable computing time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.6C
• /
• pp.554-561
• /
• 2010

This paper proposes an integer frequency offset estimation scheme robust to timing offset for the orthogonal frequency division multiplexing (OFDM)-based cognitive radio (CR) systems. The proposed scheme exploits a feature that a sample distance between a continual pilot and a scattered pilot nearest to it in an OFDM symbol belongs to one of predetermined distances. First after calculating a correlation value of every continual pilot and its nearest scattered pilot. Then, it is divided into several groups according to the sample distances. Since correlation values with the same sample distance undergo the same effect of the timing offset, the effect of the timing offset can be removed by re-correlating these correlation values. From the simulation results we can confirm that the proposed algorithm estimates the integer frequency offset with the robustness to the timing offset when compared to a conventional scheme.

• ETRI Journal
• /
• v.27 no.5
• /
• pp.617-627
• /
• 2005

This paper proposes an efficient scalar multiplication algorithm for hyperelliptic curves, which is based on the idea that efficient endomorphisms can be used to speed up scalar multiplication. We first present a new Frobenius expansion method for special hyperelliptic curves that have Gallant-Lambert-Vanstone (GLV) endomorphisms. To compute kD for an integer k and a divisor D, we expand the integer k by the Frobenius endomorphism and the GLV endomorphism. We also present improved scalar multiplication algorithms that use the new expansion method. By our new expansion method, the number of divisor doublings in a scalar multiplication is reduced to a quarter, while the number of divisor additions is almost the same. Our experiments show that the overall throughputs of scalar multiplications are increased by 15.6 to 28.3 % over the previous algorithms when the algorithms are implemented over finite fields of odd characteristics.