• Proceedings of the Korean Nuclear Society Conference
• /
• 1997.05b
• /
• pp.577-582
• /
• 1997

KSTAR 토카막$^1$플라즈마의 전류구동을 위한 RF 안테나 설계시 최적 조건을 2차원 파동 코드와 안테나 모듀울(module)을 이용하여 연구하였다 최적 조건을 얻기 위해 플라즈마와 안테나 매개변수 각각에 대한 부하와 전압정재파비(VSWR)의 관계를 살펴보았다. 계산결과로부터, 송전선의 특성저항 $R_{c}$=50$\Omega$, 안테나 폴로이달(poloidal) 길이 $A_{pl}$ =1.0m, 안테나 사이의 간격 $w_{d}$=4$^{0}$ 근처에서 최적의 안테나 조건을 갖음을 알 수 있었다.

• Journal of Broadcast Engineering
• /
• v.24 no.4
• /
• pp.613-622
• /
• 2019

A differential codebook design method using wireless channel's temporal correlation is proposed over closed loop multiple-input single-output (MISO) system. The single layer codewords in a codebook are selected among a set of phase elements. In the conventional codeword selection rule, codewords are assumed to be on a spherical cap and sine formula was used. In this paper, however, a new method using Pythagoras formula is employed to simplify computational complexity. Also, an adaptive differential codebook selection is adopted to enhance performance. Monte-Carlo simulations demonstrate that the proposed codebook is superior to the conventional ones.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.1
• /
• pp.62-69
• /
• 2011

A novel QEGT codebook index searching algorithm for long tenn evolution (LTE) system is proposed. The proposed algorithm divides the Q precoding vectors into M groups, and selects the optimal precoding vector from the selected group at the receiver. This algorithm reduced the calculation for searching the optimal precoding vector index compared to the previous algorithms. The index searching algorithm is implemented for TI's TMS320C6713 DSP board. When the number of transmit antenna is 4, the number of clock cycles is reduced to 25%.

• The Journal of the Acoustical Society of Korea
• /
• v.11 no.1
• /
• pp.22-34
• /
• 1992

There exists a transform trellis code that is optimal for stationary Gaussian sources and the squared-error distortion measure at all rates. In this paper, we train an asymptotically optimal version of such a code to obtain one which is matched better to the statistics of real world data. The training algorithm uses the M algorithm to search the trellis codebook and the LBG algorithm to update the trellis codebook. We investigate the trained transform trellis coding scheme for the first-order AR(autoregressive) Gaussian source whose correlation coefficient is 0.9 and actual speech sentences. For the first-order AR source, the achieved SNR for the test sequence is from 0.6 to 1.4 dB less than the maximum achievable SNR as given by Shannon's rate-distortion function for this source, depending on the rate and surpasses all previous known results for this source. For actual speech data, to achieve improved performance, we use window functions and gain adaptation at rate 1.0 bits/sample.

• Proceedings of the Acoustical Society of Korea Conference
• /
• spring
• /
• pp.153-156
• /
• 2000

본 논문에서는 멀티미디어 서비스들 중에서 음성 또는 오디오 신호를 저속으로 압축할 때 사용되는 G.723.1 부호화기의 line spectral frequency(LSF) 계수 양자화 방식을 고속으로 처리하는 알고리즘을 제안하였다. 제안된 고속탐색 방법은 LSF 계수의 순서성질을 이용하여 코드북의 탐색 범위를 줄임으로써 계산량을 크게 감소시킨다. 제안된 고속탐색 방법을 predictive split VQ(PSVQ) 구조를 갖는 G.723.1 에 적용한 결과 spectral distortion(SD) 성능 감쇄 및 추가적인 메모리 증가 없이 최적 코드벡터를 찾기 위한 코드북 탐색 과정에서 코드북의 평균 탐색 범위가 $20.1\%$ 감소했으며, 이는 additions, subtractions, multiplies 및 comparisons 수가 각각 $19.1\%$, $20.1\%$, $19.4\%$ 및 $12.2\% 감소하는 결과를 얻었다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10a
• /
• pp.64-66
• /
• 2003

DNA(Deoxyribo Nucleic Acid)컴퓨팅은 생체분자를 계산의 도구로 이용하는 새로운 계산 방법으로 DNA 정보 저장능력과 DNA의 상보적인 관계를 이용하여 연산을 수행하는 방법이다. 최근에는 DNA 분자들이 갖는 강력한 병렬성을 이용하여 NP-Complete 문제에 적용하는 연구가 많이 시도되고 있다. Adleman이 DNA 컴퓨팅을 이용해 해결한 HPP(Hamilton Path Problem)와는 달리 TSP(Traveling Salesman Problem)는 간선에 가중치가 추가되었기 때문에 DNA 염기배열로 표현하기가 어렵고 또한 염기배열의 길이를 줄이기 위해 고정길이 염기배열을 사용할 경우 가중치가 커지면 효율적이지 못하다. 본 논문에서는 스무딩 알고리즘(smoothing algorithm)을 사용하여 간선의 가중치를 일정한 비율로 줄인 다음 유전자 알고리즘을 사용하여 최적의 염기배열을 찾는 방법을 제안하였다.

• The Journal of the Acoustical Society of Korea
• /
• v.22 no.2
• /
• pp.129-134
• /
• 2003

In this paper, we efficiently implement the AMR speech coder by reducing the complexity of algebraic codebook search. To reduce the computational complexity of the algebraic codebook search, we propose a fast algebraic codebook search method that improves conventional depth first tree search method used in AMR speech coder algorithm. The proposed method reduces the search complexity by pruning the trees which are less possible to be selected as an optimum excitation. This method needs no additional computation for selecting the trees to be pruned and reduces the computational complexity considerably compared to the original depth first tree search method with slightly degradation or speech qualify. Applying our method to the implementation or AMR speech coder with 12.2 kbps mode by using the TeakLite DSP, we reduce the search complexity about 40% compared to the conventional method.

• Journal of computational fluids engineering
• /
• v.6 no.2
• /
• pp.9-21
• /
• 2001

초음속 여객기의 천음속 순항 성능을 개선하기 위하여 날개의 플랩 꺽임각을 최적화하였다. 이를 위하여 3차원 Euler 코드와 adjoint 코드를 이용한 최적설계기법을 적용하였다. 설계변수로서, 앞전플랩 5개, 뒷전 플랩 5개 등 총 10개의 플랩의 꺽임각이 사용되었다. 설계과정중에 격자계 내부격자점의 수정을 위해 타원형방정식법을 이용하였다. 계산 시간의 단축을 위해 내부격자의 민감도는 무시하였다. 또한 본 설계문제에 근사구배기법의 적용가능성 여부를 조사하였다. 충격파가 없는 경우 앞전 플렙에 한하여 근사구배기법을 적용할 수 있음을 알았다. 최적설계기법으로 BFGS기법을 적용하여 항력을 최소화하였으며, 양력 및 날개 표면 마하수에 대한 제약조건을 적용하였다. 앞전 플랩의 최적화 및 앞전과 뒷전 플랩의 최적화 등 두 개의 설계 문제를 고려하였다. 성공적인 결과를 얻음으로써 본 설계방법의 타당성 및 효율성을 확인하였다.

• Journal of Energy Engineering
• /
• v.24 no.2
• /
• pp.91-102
• /
• 2015

A thermal-hydraulic design and performance analysis computer code for a once-through steam generator using straight tubes is developed. To benchmark the developed physical models and computer code, an once-through steam generator developed by other designer is simulated and the calculated results are compared with the design data. Also, the same steam generator is analyzed with the best-estimate thermal-hydraulic system code, MARS, for the code-to-code validation. The overall characteristics of heat transfer area, pressure and temperature distributions calculated by the developed code show general agreements with the published design data as well as the analysis results of MARS. It is demonstrated that the developed code can be utilized for diverse purposes, such as, sensitivity analyses and optimum thermal design of a once-through steam generator.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.8
• /
• pp.656-661
• /
• 2013

In Guided Scrambling (GS) encoding for the holographic storage, after scrambling augmented source word into codeword, the best codeword satisfying modulation constraint is determined. Modulation constraints considered in this paper are strength which is the minimum number of transition between '0' and '1' in each row and column of codeword array and the symbol balancedness of codeword array. In this paper, we show that GS encoding procedure can be formulated as an integer programming model and develop a fast neighborhood search heuristic for fast computation of control bits. In the simulation, we compared the performance of heuristic algorithm with the integer programming model for various array and control bit size combinations.