• 한국정보통신학회논문지
• /
• 제4권1호
• /
• pp.59-65
• /
• 2000

This paper describes the characteristics of a one dimensional narrow-wall slotted waveguide array with a single-layer linear-to-circular polarization converter consisting of a dipole array. An external boundary value Problem of one slot and three dipoles, which approximates the mutual coupling between the dipole array and an edge slot extending over three faces of a rectangular waveguide, is formulated and analyzed by the method of moments; design of polarization conversion is conducted for this model as a unit element. If every unit element has perfect circular polarization, grating lobes appear in the array pattern due to the alternating slot angle: these are suppressed in this paper by changing the dipole angle and degrading the axial ratio of the unit element. The validity of the design is confirmed by the measurements. The dipole array has negligible effects upon slot impedance; the polarization conversion for existing narrow-wall slotted arrays is realized by add-on dipole array.

• 한국의학물리학회:학술대회논문집
• /
• 한국의학물리학회 2002년도 Proceedings
• /
• pp.318-321
• /
• 2002

As a part of the next generation PET project, we have developed a depth of interaction detector which is consist of three-dimensional arrays of GSO crystal elements sized 2.9mm ${\times}$ 2.9mm ${\times}$ 7.5mm. The basic structure of a detector block is 4-stages in depth, one stage is composed of 2 by 2 array of the crystal elements. The blocks are optically coupled to a position sensitive photomultiplier tube. Each crystal element can be in different conditions; rough or chemical etching for the crystal surface. The effect of the difference of crystal surface condition on the detector performance was analyzed in one-dimensional crystal array as a basic study for the three-dimensional detector by a simple model which is considered only probabilities of transmission, reflect and absorption of photons are in a crystal. As the next step, we investigated the effect of different crystal surface condition in a "U shaped detector" which is an array of stacked crystals bending at the center.

• Bulletin of the Korean Chemical Society
• /
• 제26권12호
• /
• pp.2075-2077
• /
• 2005

• The Journal of the Acoustical Society of Korea
• /
• 제14권2E호
• /
• pp.87-90
• /
• 1995

측방향의 음장 모양이 sinc 함수 형태를 갖고 제한 깊이까지 그 모양을 유지하는 새로운 범의 수학적인 해석방법을 제안하였다. 물리적으로 이러한 음장의 형성은 각각 다른 파장을 갖는 파가 다른 방향으로 진행할 때 그 파장들이 합성되면서 나타난다. 이러한 제한회절빔은 초음파 영상에서 선형 어레이로 구현될 수 있으며 제한 깊이 내에서 균일한 측방향 해상도를 얻을 수 있다.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2001년도 춘계종합학술대회
• /
• pp.265-268
• /
• 2001

본 논문에서는 프랙탈 영상압축 알고리즘의 고속처리를 위한 효율적인 일차원 VLSI 어레이를 설계한다 프랙탈 영상압축 알고리즘은 영상을 정의역블럭과 치역블럭을 나누고, 블럭간의 자기유사성을 비교하여 데이터를 압축시킨다. 이때 정의역블럭은 치역블럭의 두배크기로 인접한 정의역블럭과 50% 중첩시켜 분할한다. 인접한 두 정의역 블럭의 픽셀들이 중첩되므로, 이 픽셀들을 재사용하여 데이터의 입력수를 줄이고 처리속도를 향상시킬수 있다. 이 결과 최소한의 레지스터와 MUX, DEMUX의 추가만으로 약 25%의 처리속도 향상을 얻을 수 있다.

• 전자공학회논문지SC
• /
• 제39권3호
• /
• pp.220-227
• /
• 2002

프랙탈 영상압축의 고속처리를 위한 일차원 VLSI 어레이를 설계하였다. 기존의 제안된 일차원 VLSI 어레이에서 중첩되는 이웃의 정의역블럭의 데이터들을 재사용하므로서 전체 연산에 필요한 데이터의 총입력 횟수를 감소시키고, 이로 인한 전체 처리시간을 줄였다. 어레이로 입력되는 데이터의존관계를 고려하여, 입력순서가 적절히 조정되었으며, 이에 따라 처리요소들을 설계하였다. 몇몇 처리요소에는 데이터의 저장 및 경로설정을 위한 레지스터와 멀티플렉서들이 추가되었다. 따라서 영상의 크기가 N이고 블럭의 크기가 B인 경우, 이 설계는 적은 하드웨어를 추가하여 기존의 어레이보다 처리속도가 (N-4B)/4(N-B)배 향상되었다.

• 한국멀티미디어학회논문지
• /
• 제14권10호
• /
• pp.1275-1286
• /
• 2011

This paper proposes a high speed systolic array architecture for full search block matching algorithm (FBMA). The pixels of the search area for a reference block are input only one time to find the matched candidate block and reused to compute the sum of absolute difference (SAD) for the adjacent candidate blocks. Each row of designed 2-dimensional systolic array compares the reference block with the adjacent blocks of the same row in search area. The lower rows of the designed array get the pixels from the upper row and compute the SAD with reusing the overlapped pixels of the candidate blocks within same column of the search area. This designed array has no data broadcasting and global paths. The comparison with existing architectures shows that this array is superior in terms of throughput through it requires a little more hardware.

• 한국재료학회지
• /
• 제11권11호
• /
• pp.929-935
• /
• 2001

Two-dimensional computer simulations were conducted on percolation structure in which second phases of various aspect ratios were arranged in a lattice (matrix). The second phases were randomly arranged in an array with two different computational programs; one prohibiting an overlap among second phases and the other allowing the overlap. From the simulation prohibiting the overlap, it was predicted that a complete path was formed at less amounts of the second phase with higher aspect ratios. In the simulation allowing the overlap, a complete path throughout the array was formed by arranging the second phase of an aspect ratio of 1. 5, 20, 100 with less than 59%, 43%, 19%, 4% in the array, respectively.

• 한국CDE학회논문집
• /
• 제14권4호
• /
• pp.217-224
• /
• 2009

Most divide-and-conquer implementations for Delaunay triangulation utilize quad-edge or winged-edge data structure since triangles are frequently deleted and created during the merge process. How-ever, the proposed divide-and-conquer algorithm utilizes the array based data structure that is much simpler than the quad-edge data structure and requires less memory allocation. The proposed algorithm has two important features. Firstly, the information of space partitioning is represented as a permutation vector sequence in a vertices array, thus no additional data is required for the space partitioning. The permutation vector represents adaptively divided regions in two dimensions. The two-dimensional partitioning of the space is more efficient than one-dimensional partitioning in the merge process. Secondly, there is no deletion of edge in merge process and thus no bookkeeping of complex intermediate state for topology change is necessary. The algorithm is described in a compact manner with the proposed data structures and operators so that it can be easily implemented with computational efficiency.

• Journal of applied mathematics & informatics
• /
• 제27권5_6호
• /
• pp.1211-1220
• /
• 2009

In this paper, we consider the multipoint boundary value problem for the one-dimensional p-Laplacian $({\phi}_p(u'))'$(t)+q(t)f(t,u(t),u'(t))=0, t $\in$ (0, 1), subject to the boundary conditions: $u(0)=\sum\limits_{i=1}^{n-2}{\alpha}_iu({\xi}_i),\;u(1)=\sum\limits_{i=1}^{n-2}{\beta}_iu({\xi}_i)$ where $\phi_p$(s) = $|s|^{n-2}s$, p > 1, $\xi_i$ $\in$ (0, 1) with 0 < $\xi_1$ < $\xi_2$ < $\cdots$ < $\xi{n-2}$ < 1 and ${\alpha}_i,\beta_i{\in}[0,1)$, 0< $\sum{\array}{{n=2}\\{i=1}}{\alpha}_i,\sum{\array}{{n=2}\\{i=1}}{\beta}_i$<1. Using a fixed point theorem due to Bai and Ge, we study the existence of at least three positive solutions to the above boundary value problem. The important point is that the nonlinear term f explicitly involves a first-order derivative.