• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.4
• /
• pp.138-144
• /
• 1989

In this paper, a new method is proposed to remove the logical redundancy for the gate-level circuit optimization. In this method, only the fanout-branch signals in the circuits, not all the signals, are examined for redundancy. When a signal is determined to be nonredundant, other nonredundant signals are found out by the efficient procedure, using only the informations which are generated in the course of the redundancy-check. In order to avoid the re-examination of a signal for redudancy, a heuristic method is proposed to determine the redundancy-checking order of signals. The proposed method is heuristic, based on the VLSI test theory. It is much faster than other methods, since it does not reexamine a signal for redundancy.

• Progress in Medical Physics
• /
• v.24 no.2
• /
• pp.108-118
• /
• 2013

Currently, an arterial spin labeling (ASL) magnetic resonance imaging (MRI) technique does not routinely used in clinical studies to measure perfusion in brain because optimization of imaging protocol is required to obtain optimal perfusion signals. Therefore, the objective of this study was to investigate changes of perfusion-weighed signal intensities with varying several parameters on a pulsed arterial spin labeling MRI technique obtained from a 3T MRI system. We especially evaluated alternations of ASL-MRI signal intensities on special brain areas, including in brain tissues and lobes. The signal targeting with alternating radiofrequency (STAR) pulsed ASL method was scanned on five normal subjects (mean age: 36 years, range: 29~41 years) on a 3T MRI system. Four parameters were evaluated with varying: 1) the labeling gap, 2) the labeling delay time, 3) the labeling thickness, and 4) the slice scan order. Signal intensities were obtained from the perfusion-weighted imaging on the gray and white matters and brain lobes of the frontal, parietal, temporal, and occipital areas. The results of this study were summarized: 1) Perfusion-weighted signal intensities were decreased with increasing the labeling gap in the bilateral gray matter areas and were least affected on the parietal lobe, but most affected on the occipital lobe. 2) Perfusion-weighted signal intensities were decreased with increasing the labeling delay time until 400 ms, but increased up to 1,000 ms in the bilateral gray matter areas. 3) Perfusion-weighted signal intensities were increased with increasing the labeling thickness until 120 mm in both the gray and white matter. 4) Perfusion-weighted signal intensities were higher descending scans than asending scans in both the gray and white matter. We investigated changes of perfusion-weighted signal intensities with varying several parameters in the STAR ASL method. It should require having protocol optimization processing before applying in patients. It has limitations to apply the ASL method in the white matter on a 3T MRI system.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1999.11b
• /
• pp.261-266
• /
• 1999

본 논문에서는 인터넷 폰이나 디지털 이동통신에서와 같이 낮은 비트율이 요구되는 응용분야에서 사용될 수 있는 HVXC 부호화 및 복호화 알고리즘을 TMS320C6701 160MHz DSP를 사용하여 실시간 동작을 구현한 내용을 기술한다. 사용한 최적화 방법으로는 기본적으로 연산 시간이 많이 소요되는 함수 루틴에 대한 C 언어레벨의 최적화 및 어셈블리어 레벨의 최적화를 수행하였고, TMS320C6701 DSP 내부 프로그램 메모리를 프로그램 캐쉬로 사용하였다. 또한, 계산량이 많은 부분과 테이블 참조가 필요한 연산을DSP의 내부 데이터 메모리 영역에서 수행하여 소요시간을 단축하였으며, 음성신호 및 비트스트림의 입출력에는 background DMA(direct memory access) 방식을 이용하였다. 이와 같은 최적화결과 2kbps 및 4kbps의 비트율에서 압축 및 복원을 실시간으로 수행할 수 있다.

• Proceedings of the KAIS Fall Conference
• /
• 2010.11a
• /
• pp.367-369
• /
• 2010

본 논문은 열차제어시스템 유지보수업무의 최적화를 위한 정량적 주기산출방법에 관한 것으로, 특히 전장품과 같이 유지보수업무로 주로 교체업무가 선택되는 경우, 운영비용을 최적화하기 위한 교체주기를 정량적으로 산출하기위한 방법을 제시하고, 장치의 고장분포 데이터를 통해, 철도신호장치의 교체주기를 할당한다. 제시한 방법은 유지보수장치의 운영이력을 분석하여, 장치의 고장데이터를 바탕으로 고장분포를 확률적으로 모델링한 뒤, 정확한 LCC데이터가 적용될 때 새롭게 도입되는 장비 및 시스템의 유지보수업무주기를 할당이 가능하고, 이를 통해여 시스템의 운영안전을 보장하면서, 운용비용을 최적화 할 수 있다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2010.07a
• /
• pp.224-226
• /
• 2010

컴퓨터 생성 홀로그램(computer-generated hologram, CGH) 기법은 광학 신호들을 근사화한 후 PC에서 수학적인 연산으로 디지털 홀로그램을 생성하는 기술이다. 본 논문에서는 CGH 기법을 하드웨어로 구현할 경우 완벽한 병렬처리와 파이프라이닝이 가능하도록 연산식을 최적화하는 방법을 제안한다. 제안한 방법은 홀로그램의 이전 좌표에서 계산된 값에 일정한 값을 더하여 홀로그램을 생성하는 반복가산 기법의 일반항을 분석하여 하드웨어에 최적화된 수식으로 변형하는 것이다. 최적화된 수식의 경우 현재 좌표의 홀로그램을 계산하기 위해 이전 좌표에서 연산되었던 결과값을 기다렸다 이용하지 않기 때문에 실시간 디지털 홀로그래피를 위한 전용 하드웨어의 설계에 적합할 것이다.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2004.05a
• /
• pp.802-805
• /
• 2004

표준 단일모드 광섬유를 전송선으로 사용하고, Raman 중폭기 없이 EDFA 증폭기 만을 사용하여, 각 채 널당 10Gb/s 의 파장다중화된 40 개 채널신호들을 3,000km 전송하는 경제적인 광 링크를 구성 한 뒤, 이 링크의 전송 성능 최적화를 위해 분산 맵 구조의 차이 에 따른 성능 차이를 분석하였다. 이 링크의 분산 맵은 전치분산보상, 구간분산보상 그리고 후치분산보상으로 나누어 지는데 이 들의 다양한 조합을 통해 15 가지의 다양한 분산 맵들을 구성한 뒤 각각의 경우를 분석하여 링크 성능을 크게 향상시키는 최적화된 분산맵 구조를 구하였다. 이 최적화된 분산 조건이, 단일 모드 광섬유와 분산보상 광섬유가 가지 는 파장에 따른 분산 기울기의 불일치로 인해 받게 되는 영향이 조사되었고 이 영향이 링크의 성능에 미치는 효과가 무시될 수 있는 분산 기울기의 허용 가능한불일치 범위를 구하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.10
• /
• pp.2001-2013
• /
• 1994

In this paper, the method of processing a blurred noisy image has been researched. The conventional method of processing signal has faluts which are slow convergence speed and long time-consuming process at the singular point and or in the ill condition. There is the process, the Gauss Seidel's method to remove these faults, but it takes too much time because it processed singnal repeatedly. For overcoming the faults, this paper shows a image restoration method which takes shorter than the Gauss-Seidel's by comparing the Gauss Seidel's with proposed alogorithm and accelerating convergence speed at the singular point and/or in the ill condition. In this paper, the conventional process method(Gauss-Seidel) and proposed optimal algorithm were used to get a standard image($256{\times}56{\times}bits$). and then the results are simulated and compared each other in order to examine the variance of MSE(Mean Square Error) by the acceleration parameter in the proposed image restoration. The result of the signal process and the process time was measured at all change of acceleration parameter in order to verify the effectveness of the proposed algorithm.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.41 no.6
• /
• pp.81-90
• /
• 2004

For deep submicron (DSM) very large scale integrated circuits (VLSI), it is well known that interconnects have become the dominant factor in determining the overall circuit performance. Buffer insertion is an effective technique of interconnect optimization. When a net has an excessive propagation delay, one or more buffers can be inserted to reduce the delay. Buffers also reduce the crosstalk between neighboring wires. While many conventional methods insert buffers net by net. we have developed new techniques in which buffer locations are simultaneously optimized for all nets. This is to avoid the difficulties in finding the right ordering of nets for buffer insertion. since several nets may compete for a buffer location. We also study buffer insertion with multiple fan-out nets to optimize critical path delay. Elmore delay model is used for delay calculation and the number of buffers for each net is determined to optimize the delay.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.10
• /
• pp.715-721
• /
• 2014

In decades, many researchers have studied the time delay estimation (TDE) method for the signals in the two different receivers. The channel estimation based TDE is one of the typical TDE methods. The channel estimation based TDE models the time delay between two receiving signals as an impulse response in a channel between two receivers. In general the impulse response becomes sparse. However, most conventional TDE algorithms cannot have utilized the sparsity. In this paper, we propose a TDE method taking the sparsity into consideration. The performance comparison shows that the proposed algorithm improves the estimation accuracy by 10 dB in the white gaussian source. In addition, even in the colored source, the proposed algorithm doesn't show the estimation threshold effect.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.4
• /
• pp.938-946
• /
• 1996

Hierarchical subband codec has been widely promoted in the field of data compression/decompression because of their simplicity and modular nature. Over the past years, the study has received great attention to the perfect reconstruction (PR)system which perfectly recovers the original input signal at the reconstructed output. However, in the actual subband codec system, the signals that passed through the analysis filter bank are quantized before transmission to the receiver side and reconstructed by the synthesis filter bank. Thus the PR system is impossible and the quantization effects must be carefully considered in the system design such that the system recovers the reconstructed output as possible to the the original input signal with minimum quantization error.In this paper, we propose an optimum hierarchical subband codec structure in the presence of quantizer. The optimality criteria of the code is given to the deign of the hierarchical analysis/synthesis subband filter bank and the quantizer that minimize then output mean square error due to the quantizer in the codec. Specific opti-mum design esamples are shown with level-1, level-2 hierarchical structure. The optimal designs are verified by computer simulation.