• Management Science and Financial Engineering
• /
• 제12권1호
• /
• pp.127-142
• /
• 2006

In this paper, we present a frequency reassignment problem (FRP) that arises when we add new base stations to resolve hot-spots or to expand the coverage of a code division multiple access (CDMA) network. For this problem, we develop an integer programming (IP) model along with some valid inequalities and preprocessing rules. Also, we develop an effective heuristic procedure that solves two sub-problems induced from the original problem in repetition. Computational results show that the proposed heuristic procedure finds a feasible solution of good quality within reasonable computation time. Also, the lower bound by-produced from the heuristic procedure is quite strong.

• 한국IT서비스학회지
• /
• 제10권1호
• /
• pp.117-133
• /
• 2011

In this paper, we present a frequency reassignment problem (FRP) arising from the reconfiguration of radio networks such as adding new base stations (BSs) and changing the number of frequencies assigned to BSs. For this problem, we develop an integer programming (IP) model that minimizes the sum of frequency reassignment cost and the cost for unsatisfied frequency demands, while avoiding interference among frequencies. To obtain tight lower bounds, we develop some valid inequalities and devise an objective function relaxation scheme. Also, we develop a simple but efficient heuristic procedure to solve large size problems. Computational results show that the developed valid inequalities are effective for improving lower bounds. Also, the proposed tabu search heuristic finds tight upper bounds with average optimality gap of 2.3%.

• 전자공학회논문지A
• /
• 제33A권2호
• /
• pp.40-49
• /
• 1996

In this paper, we studied channel assignment and handover schemes for the indoor microcell systems. For efficient frequency spectrum reuse we proposed the high quality reassignment (HQR) scheme. Proposed HQR scheme tries to keep the reuse distances small by monitoring C/I of channels being used. To assign a channel for a new or handove call, the scheme checks C/I of all available channels. Then HQR assigns the channel that has C/I near the threshold value, A_TH. The scheme also checks C/I of ongoing calls and continuously reassigns a new channel when needed. It attempts handover not only when C/I gets below a handover threshold value, HO_TH, but also when C/I becomes above a high quality reassignment threshold, H_TH. The performance of the proposed HQR scheme was analyzed by a computer simulation configuraed. The performance of the scheme was also analyzed for various threshold values selected and the results are presented in this paper. The results show that HQR scheme perfomrs better than the scheme adopted for DECT.

• 한국음향학회지
• /
• 제37권6호
• /
• pp.457-467
• /
• 2018

본 논문은 정현파 신호에 대해 고해상도 주파수 추정이 가능한 알고리즘들의 성능을 비교 분석하였다. 비교 대상 알고리즘은 총 5가지로 DFT(Discrete Fourier Transform - 성능 평가 기준), Jacobsen, Candan, 재할당(Reassignment) 알고리즘 및 Cedron 알고리즘이다. 각 알고리즘의 성능을 SNR(Signal to Noise Ratio), 윈도우 함수, 윈도우 길이 등의 요소를 변화시켜가며 성능을 측정하였다. 알고리즘의 성능 평가는 편의 및 오차(Mean Square Error, MSE), 분산을 이용하여 측정하였으며, 실험결과 Cedron 알고리즘이 좋은 성능을 보였다. 실제 공학문제에서의 활용을 위해서는 각 알고리즘별로 보다 다양한 조건에서 실험 결과를 분석하고 개선시킬 필요가 있다.

• 한국소음진동공학회논문집
• /
• 제22권3호
• /
• pp.291-297
• /
• 2012

Conventional Fourier analysis can give only limited information about the dynamic characteristics of nonstationary signals. Instead, time-frequency analysis is widely used to investigate the nonstationary signal in detail. Several time-frequency analysis methods are compared for a typical acoustic emission burst generated during the impact between a ferrite ceramic and aluminum plate. This AE burst is inherently nonstationary and random containing many frequency contents, which leads to severe interference between cross terms in bilinear convolution type distributions. The smoothing and reassignment processes can improve the readability and resolution of the results. Spectrogram and scalogram of the AE burst are obtained and compared to get the characteristics information. Renyi entropies are computed for various bilinear time-frequency transforms to evaluate the randomness. These bilinear transforms are reassigned by using the improved algorithm in discrete computation.

• 한국IT서비스학회지
• /
• 제9권3호
• /
• pp.107-121
• /
• 2010

In this paper, we present a frequency reassignment problem (FRP) that arises when we install new base stations or reconfigure radio networks to increase the capacity or to expand service area. For this problem, we develop an integer programming (IP) model, and develop cutting planes to enhance the mathematical representation of the model. Also, we devise an effective tabu search algorithm to obtain tight upper bounds within reasonable time bounds. Computational results exhibit that the developed cutting planes are effective for reducing the computing time as well as for increasing lower bounds. Also, the proposed tabu search algorithm finds a feasible solution of good quality within reasonable time bound.

• 산업공학
• /
• 제13권4호
• /
• pp.694-702
• /
• 2000

For the graceful transition from the analog to digital TV systems, a systematic frequency assignment scheme must be incorporated into the transition planning procedure. In this study, we have studied the frequency assignment methodology for the efficient management of the limited spectrum resources. By applying the graph-theoretic approach, this study developed a new solution method for additional frequency assignment problem whose objective is to assign available frequencies for newly generated requirements (digital TV stations) with minimum reassignment of the preassigned frequencies to LPTV stations while meeting the interference-related constraints. The proposed algorithm can be effectively applied not only to the current digital TV introduction phase but also to the development phase with some further development. This study can be utilized as the basis for the future study on frequency assignments that aims at graceful transition from analog TV to digital TV.

• Smart Structures and Systems
• /
• 제9권5호
• /
• pp.441-459
• /
• 2012

Identification of vibration parameters from the analysis of the dynamic response of a structure plays a key role in current health monitoring systems. This study evaluates the capabilities of the recently developed Synchrosqueezed Wavelet Transform (SWT) to extract instant frequencies and damping values from the simulated noise-contaminated response of a structure. Two approaches to estimate the modal damping ratio from the results of the SWT are presented. The results obtained are compared to other signal processing methods based on Continuous Wavelet (CWT) and Hilbert-Huang (HHT) transforms. It was found that the time-frequency representation obtained via SWT is sharped than the obtained using just the CWT and it allows a more robust extraction of the individual modal responses than using the HHT. However, the identification of damping ratios is more stable when the CWT coefficients are employed.

• 한국소음진동공학회논문집
• /
• 제16권3호
• /
• pp.255-262
• /
• 2006

Frequency spectrum using the conventional Fourier analysis gives adequate information about the dynamic characteristics of the slider air bearing for the linear and stationary cases. The intermittent contacts for the extremely low flying height, however, generate nonlinear and nonstationary vibration at the instant of contact. Nonlinear dynamic model should be developed to simulate the impulse response of the air bearing during slider-disk contact. Time-frequency analysis is widely used to investigate the nonstationary signal. Several time-frequency analysis methods are employed and compared for the slider vibration signal caused by the impact against an artificially induced scratch on the disk. The representative Wigner-Ville distribution leads to the severe interference problem by cross terms even though it gives good resolution both in time and frequency. The smoothing process improves the interference problem at the expense of resolution. In order to get the results with good resolution and little interference, the reassignment method is proposed. Among others the reassigned Gabor spectrogram shows the best resolution and readability with negligible interference.

• 대한산업공학회지
• /
• 제31권1호
• /
• pp.1-9
• /
• 2005

This paper proposes the heuristic algorithm for the generalized GT problems to consider the restrictions which are given the number of machine cell and maximum number of machines in machine cell as well as minimum number of machines in machine cell. This approach is split into two phase. In the first phase, we use the similarity coefficient which proposes and calculates the similarity values about each pair of all machines and sort these values descending order. If we have a machine pair which has the largest similarity coefficient and adheres strictly to the constraint about birds of a different feather (BODF) in a machine cell, then we assign the machine to the machine cell. In the second phase, we assign parts into machine cell with the smallest number of exceptional elements. The results give a machine-part grouping. The proposed algorithm is compared to the Modified p-median model for machine-part grouping.