• 전자공학회논문지 IE
• /
• v.45 no.2
• /
• pp.13-19
• /
• 2008

The main advantage of the TLM analysis method is the ease with which even the most complicated transmission line structures. In this paper, using symmetrical condensed node(SCN), the TLM numerical technique has been successfully a lied to microstrip meander line. A detailed technique of the symmetrical condensed node(SCN) may be used to model planar microstrip transmission line is presented. Also, the S-parameters $S_{11}$ and $S_{21}$ of two types of microstrip meander line have been computed. From obtained results, TLM analysis is shown to be an efficient method for modeling complicated structure of planar microstrip transmission line. The TLM results presented here are useful in the design of microwave integrated circuits at higher frequencies region.

• Journal of the Korean Institute of Telematics and Electronics T
• /
• v.36T no.2
• /
• pp.63-69
• /
• 1999

The frequency-dependent characteristics of the finline have previously been analyzed using several frequency domain approaches. But the time domain TLM method presented in this paper is another independent approaches for obtaining frequency domain results for finline. The structure analysed with this algorithm is unilateral finline in WR-62 waveguide enclosures and the symmetrical condensed node based on the properties of Huygen's scattering model is used. From the TLM results, the frequency-dependent scattering parameters of a unilateral finline have been calculated by Fourier transform of the time domain data. The numerical results are in good agreements with other paper, thus demonstrating the validity and usefulness of the proposed method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.2C
• /
• pp.100-109
• /
• 2003

A differential index assignment scheme is proposed for the image encoding system in which a variable-length tree-structured vector quantizer is adopted. Each source vector is quantized into a terminal node of VLTSVQ and each terminal node is represented as a unique binary vector. The proposed index assignment scheme utilizes the correlation between interblocks of the image to increase the compression ratio with the image quality maintained. Simulation results show that the proposed scheme achieves a much higher compression ratio than the conventional one does and that the amount of the bit rate reduction of the proposed scheme becomes large as the correlation of the image becomes large. The proposed encoding scheme can be effectively used to encode R images whose pixel values we, in general, highly correlated with those of the neighbor pixels.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.8
• /
• pp.1511-1518
• /
• 2008

Wireless sensor network is a network that consists of small wireless sensor nodes. Sensor nodes transfer the sensed data about the objects or environment to the sink through wireless channel. The energy dissipation by wireless transmission is the primary factor of energy dissipation in the sensor node. To utilize the limitted resource at the sensor node, it is required to reduce the number of wireless transmission. In the paper, we proposes a new energy efficient method, NRMC, to reduce the energy dissipation by using the compression technique - DPCM, Wavlet, Quantization, RLC. With NTRC, the life time of sensor network could be increased.

• Journal of Korea Society of Industrial Information Systems
• /
• v.15 no.3
• /
• pp.11-21
• /
• 2010

Increase in the number of sensor nodes in sensor networks and sensor node to automatically assign addresses are needed. The method developed to address existing severe wasting, coordinators have all address information, each sensor node when addressing the shortcomings are a lot of traffic. In this paper, 6LoWPAN automatically from the sensor nodes capable of efficiently addressing Hop-Count based hierarchical address allocation algorithm is proposed. How to propose a hop-count of divided areas are separated, with no overlap and can be assigned a unique address, DAD(Duplicate Address Detection) reduced area. Perform DAD to reduce traffic, packet transmission in the IP header destination address, respectively, with a minimum 32-bit compression and packet transmission over a non-compression method to reduce the number of 11.1%.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10d
• /
• pp.435-439
• /
• 2007

최근 저가형 이미지 센서 기술의 발전과 무선 센서 네트워크기술의 발전으로 인해 WMSN(Wireless Multimedia Sensor Networks) 기술이 활발히 연구되고 있다. WMSN은 기존의 무선 센서 네트워크 기술에 멀티미디어 컨텐츠를 센싱하고 전송 및 처리하는 기반기술을 포함한다. 멀티미디어 컨텐츠는 많은 데이터 가지므로 이를 처리하기 위해서는 많은 계산량과 데이터 전송량을 필요로 하게 된다. 저사양의 센서 노드에서 멀티미디어 컨텐츠를 수용하기 위해서는 에너지 소모를 고려한 압축 기법 및 효율적인 전송에 대한 연구가 필요하다. 본 논문에서는 무선 센서 네트워크에서 이미지를 효율적으로 압축하고 전송하기 위하여 웨이블릿의 Resolution Scalability 특성을 이용한 4가지 움직임 보상/예측 기법을 제안한다. 이를 지원하기 위해 시스템에서 사용하는 각 압축 기법들의 조합에 따른 압축 성능이 적절함을 알아보았다.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.12
• /
• pp.3257-3264
• /
• 1998

본 논문은 다해상도 웨이브릿 변환 영상에 대해 각 대역간의 상관관계와 대역내의 상관관계를 이용한 정지 영상 압축 알고리즘을 제안한다. 기존의 대역분할 방식은 각 대역의 계수값의 특성을 이용한 부호화 방식과 대역간의 상관계만을 이용했던 것과는 달리 본 논문에서는 대역간의 상관관계뿐만 아니라 대역내의 이웃하는 픽셀간의 상관관계를 이용했다. 즉, 제안한 방식은 대역내의 계수들을 2x2 블록으로 해서 각 블록을 루트노드로 대역간의 상관관계를 이용했다. 만약 LL대역내의 2x2 블록내에 기준 임계치를 초과하는 계수가 존재치 않을 때는 블록 전체를 하나의 심볼로 부호화 함으로서 위치정보의 부호화 수를 줄여 부호화의 효율을 증가시켰다. 위치정보의 부호화를 위해 적응형 산술부호화를 사용하여 부호화 하였다. 또한 높은 압축율을 위해 Antonini의 9/7 tap biorthogonal 웨이브릿을 사용했고 이에 따른 실험결과 같은 비트율에서 JPEG 시스템보다 3.4dB의 성능향상을 보였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10a
• /
• pp.658-660
• /
• 1999

Ziv-Lempel 코딩 방식은 문자열이 반복해서 나올 때 뒤에 나오는 문자열을 앞에 나온 문자열에 대한 포인터로 대칭시킴으로써 압축을 한다. 따라서 이 방식을 위해서는 앞서 나온 문자열을 유지하는 사전과 문자열 매칭이 필수적이다. 그래서 이 두 가지에 효율적인 자료구조인 접미사 트리를 Ziv-Lempel 코딩 방식에 적용시키려고, 그 이후에 Fiala, Greene와 Larsson은 각각 McCreight와 Ukkonen의 접미사 트리 생성 알고리즘을 LZ77 코딩에 이용하였다. 접미사 트리를 이용한 Zv-Lempel 코딩에는 만들어진 사전, 즉 접미사 트리와 앞으로 압축될 문자열과의 가장 긴 매치는 찾는 과정이 있다. 이는 단순히 접미사 트리의 루트부터 차례로 검색해 나가도 되지만 이렇게 했을 때 걸리는 시간은 노드에서 자식을 찾는데 걸리는 분기 결정 시간에 의해 좌우된다. 즉 분기에 성형 시간 이상이 걸리면 가장 긴 매치를 찾는데도 역시 선형 시간 이상이 걸린다. 게다가 이 방법은 자기 중복(self-overlapping)의 이점을 살릴 수가 없다. Rodeh, Pratt와 Even은 McCreight의 생성 알고리즘을 이용할 때 가장 긴 매치를 바로 찾을 수 있다는 것을 발견했다. 그러나 Ukkonend의 알고리즘에 대해서는 아직 이러한 방법이 알려지지 않았다. 본 논문에서는 Ukkonen의 알고리즘에 몇가지 작업을 추가하여 전체적으로 선형시간안에 가장 긴 매치를 찾는 방법을 소개한다.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.2
• /
• pp.133-142
• /
• 2009

Recently, with the advance of wireless internet and the frequent use of mobile devices, demand for LBS(Location Based Service) is increasing, and research is required on spatial indexes for the storage and maintenance of spatial data to provide efficient LBS in mobile device environments. In addition, the use of flash memory as an auxiliary storage device is increasing in order to store large spatial data in a mobile terminal with small storage space. However, the application of existing spatial indexes to flash-memory lowers index performance due to the frequent updates of nodes. To solve this problem, research is being conducted on flash-memory based spatial indexes, but the efficiency of such spatial indexes is lowered by low utilization of buffer and flash-memory space. Accordingly, in order to solve problems in existing flash-memory based spatial indexes, this paper proposed FR-Tree (Flash-Memory based R-Tree) that uses the node compression technique and the delayed write operation technique. The node compression technique of FR-Tree increased the utilization of flash-memory space by compressing MBR(Minimum Bounding Rectangle) of spatial data using relative coordinates and MBR size. And, the delayed write operation technique reduced the number of write operations in flash memory by storing spatial data in the buffer temporarily and reflecting them in flash memory at once instead of reflecting the insert, update and delete of spatial data in flash-memory for each operation. Especially, the utilization of buffer space was enhanced by preventing the redundant storage of the same spatial data in the buffer. Finally, we perform ed various performance evaluations and proved the superiority of FR-Tree to the existing spatial indexes.

• The KIPS Transactions:PartA
• /
• v.9A no.2
• /
• pp.217-224
• /
• 2002

Many systems handle 3D-image were used. High-performance computer systems and techniques of compressing images to handle 3D-image were used. But there will be cost Problems, if GIS system is implemented, using the high-performance system. And if GIS system is implemented, using the techniques of compressing images, there will be some loss of a image. It will take a long processing time to handle 3D-images using a general PC because the size of 3D-image files are very huge. The parallel algorithm presented in the paper can improve speed to handle 3D-image using parallel computer system. The system uses the method of displacing images from nodes to screens, dividing a 3D-image into multiple sub images on multiple nodes. The performance of the presented algorithm showers improving speed by experiments.