• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.7
• /
• pp.422-430
• /
• 2002

For a time-multiplexed FPGA, a circuit is partitioned into several subcircuits, so that they temporally share the same physical FPGA device by hardware reconfiguration. In these architectures, all the hardware reconfiguration information called contexts are generated and downloaded into the chip, and then the pre-scheduled context switches occur properly and timely. Since the maximum number of the LUT's required in the same time determines the size of the chip used in the synthesis, it needs to be minimized, if possible. Many previous work use their own approaches, which are very similar to either scheduling method in high level synthesis or multi-way circuit partitioning method, to solve the problem. In this paper, we propose a method which estimates the lower bound on the number of LUT's without performing any actual synthesis. The estimated lower bounds help to evaluate the results of the previous work. If the estimated lower bound on the number of LUT's exactly matches the number of LUT's of the result from the previous work, the result must be optimal. In contrast, if they do not match, the following two cases are expected : the more exact lower bound may exist, or we might find the new synthesis result better than the result from the previous work. Experimental results show that our lower bound estimation method is very accurate. In almost al] cases experimented, the estimated lower bounds on the number of LUT's exactly match those of the previous synthesis results respectively, implying that the best results from the previous work are optimal as well as our method predicted the exact lower bound for those examples.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.9
• /
• pp.512-522
• /
• 2003

For a time-multiplexed FPGA, a circuit is partitioned into several subcircuits, so that they temporally share the same physical FPGA device by hardware reconfiguration. In these architectures, all the hardware reconfiguration information called contexts are generated and downloaded into the chip, and then the pre-scheduled context switches occur properly and timely. Typically, the size of the chip required to implement the circuit depends on both the maximum number of the LUT blocks required to implement the function of each subcircuit and the maximum number of micro-registers to store results over context switches in the same time. Therefore, many partitioning or synthesis methods try to minimize these two factors. In this paper, we present a new estimation technique to find the lower bound on the number of micro-registers which can be obtained by any synthesis methods, respectively, without performing any actual synthesis and/or design space exploration. The lower bound estimation is very important in sense that it greatly helps to evaluate the results of the previous work and even the future work. If the estimated lower bound exactly matches the actual number in the actual design result, we can say that the result is guaranteed to be optimal. In contrast, if they do not match, the following two cases are expected: we might estimate a better (more exact) lower bound or we find a new synthesis result better than those of the previous work. Our experimental results show that there are some differences between the numbers of micro-registers and our estimated lower bounds. One reason for these differences seems that our estimation tries to estimate the result with the minimum micro-registers among all the possible candidates, regardless of usage of other resources such as LUTs, while the previous work takes into account both LUTs and micro-registers. In addition, it implies that our method may have some limitation on exact estimation due to the complexity of the problem itself in sense that it is much more complicated than LUT estimation and thus needs more improvement, and/or there may exist some other synthesis results better than those of the previous work.

• The Journal of the Acoustical Society of Korea
• /
• v.36 no.3
• /
• pp.218-227
• /
• 2017

In this paper, an algorithm to calculate both bearing and distance error for target detection and localization is proposed using the Cramer Rao lower bound to estimate the minium variance of their error in DOA (Direction Of Arrival) estimation. The performance of arrays in detection and localization depends on the accuracy of DOA, which is affected by a variation of SNR (Signal to Noise Ratio). The SNR is determined by sonar parameters such as a SL (Source Level), TL (Transmission Loss), NL (Noise Level), array shape and beam steering angle. For verification of the suggested method, a Monte Carlo simulation was performed to probabilistically calculate the bearing and distance error according to the SNR which varies with the relative position of the target in space and noise level.

• Proceedings of the Korean Statistical Society Conference
• /
• 2002.11a
• /
• pp.185-189
• /
• 2002

본 논문에서는 초 모집단 모형 하에서 HT 추정량의 분산의 하한에 관계된 층화추정량의 효율성에 대해 다루었다. 특별히 Dalenius-Hodges 층화와 표본배분방법 중 멱배분(power allocation)을 적용했을 때 최소분산 성질에 대해 살펴보았다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.4
• /
• pp.7-12
• /
• 2019

Ambient backscatter communication is limited to channel estimation technique through a pilot signal, which is a channel estimation method in current RF communication, due to transmission power efficiency. In a limited transmission power environment, the research of traditional ambient backscatter communication has been studied assuming that it is an ideal channel without signal distortions due to channel conditions. In this paper, we propose an expectation-maximization(EM) algorithm, one of the blind channel estimation techniques, as a channel estimation method in ambient backscatter communication system which is the state of channel following normal distribution. In the proposed system model, the simulations confirm that channel estimate through EM algorithm is approaching the lower bound of the mean square error compared with the Bayesian Cramer-Rao Boundary(BCRB) to check performance. It shows that the channel parameter can be estimated in the ambient backscatter communication system.

• Journal of Satellite, Information and Communications
• /
• v.7 no.1
• /
• pp.53-58
• /
• 2012

In this paper, we evaluate and analyze representative estimation methods for the sparse channel. In order to evaluate error performance of matching pursuit(MP) and minimum mean square error(MMSE) algorithm, lower bound of MMSE is determined by Cramer-Rao bound and compared with upper bound of MP. Based on analysis of those bounds, mean square error of MP which is effective in the estimation of sparse channel can be larger than that of MMSE according to the number of estimated tap and signal-to-noise ratio. Simulation results show that the performances of both algorithm are reversed on the sparse channel with Rayleigh fading according to signal-to-noise ratio.

• Proceedings of the Korean Society for Bio-Environment Control Conference
• /
• 1999.04a
• /
• pp.67-70
• /
• 1999

시설내의 고품질 표고생산을 위하여 동고와 화고의 생육환경을 구명하는 것이 필요하다. 시설재배를 위한 생육환경 구명을 위하여 기상환경을 분석한 결과, 290종균의 발생 범위의 하한치부터 진폭이 시작되어 후기로 갈수록 최고 발생 적온으로 상승하였다. 습도는 화고의 경우, 생육초기는 적정 생육습도가 유효하며, 후기로 갈수록 습도의 일교차가 증가하여 화고의 발생량이 증가하는 것으로 추정된다. 본 연구는 동고 및 화고 발생기간의 기상환경을 분석한 것으로, 추후 시설 내에서의 고품질 표고 생산을 위한 기초 자료로 사용 가능하다.

• Journal of the Korean Society of Fisheries and Ocean Technology
• /
• v.36 no.3
• /
• pp.195-201
• /
• 2000

This paper discusses methods for the stable bottom detection and the optimum bottom offset which enable to separate the fish echoes from the bottom echoes with echo integration of demersal fish. In preprocessing of the echo signal, the bottom detection has to be done stably against the fluctuation of echo level and the bottom offset has to be set to a minimum height such that near bottom fish echoes are included Two methods of bottom detection, namely echo level threshold method and maximum echo slope method were compared and analyzed. The echo level method works well if the ideal threshold level was given but it sometimes misses the bottom because of the fluctuation of the echo. Another method to detect the bottom which uses maximum echo slope indicates the simple and stable bottom detection. In addition, the bottom offset has to be set near to the bottom but not to include the bottom echo. Optimum bottom offset should be set a few samples before the detected bottom echo which relates the beginning of pulse shape and acoustic beam pattern to the bottom feature.

• Journal of Navigation and Port Research
• /
• v.41 no.3
• /
• pp.87-92
• /
• 2017

To enhance the reliability and/or resilience of the PNT service included in the e-Navigation strategy of the IMO, the evaluation of the AIS-TWR method for the asynchronous R-mode for maritime service, which is available even in the absence of the GNSS, is described. For the AIS-TWR, which is capable of ranging through message exchange even without high precision synchronization, the operation scenario and the error factors according to the AIS system specifications are proposed and analyzed. Cramer-Rao Lower Bound is presented for the performance evaluation of the AIS-TWR algorithm. A simulation by AIS-TWR method of two AIS systems in a 3 km static environment shows estimation error of about 41m compared to the real value..

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.2
• /
• pp.277-286
• /
• 2010

In this paper amplitude and phase distortion of the received signal through a fading channel results in a severe performance degradation of the communication system, Therefore we consider the variance of the maximum a posteriori phase estimate of sinusoidal signal by the Cramer-Rao bound in wireless fading channel. To find the Cramer-Rao lower bound for the variance of the phase, We use the derived probability density function(pdf) of the phase in Nakagami fading channel. We analyze the error performance of modulation signals using order statistics on generalized combining reception and find adequate diversity branch number.