• Spatial Information Research
• /
• v.17 no.2
• /
• pp.183-189
• /
• 2009

The modification of digital maps because of creation, extinction, and change of topology can be expressed by change of information. But according to complication of society, topology of digital maps and relation with another objects is more complicated. We carry out partial update using as-built drawings to reflect in digital maps efficiently with maintaining accuracy and update. This supplement a weak point of partial update without field surveying. But unlike creation and extinction of file with information or of entire database, when each object is changed, added problem will come like change of raw data and of updating date. So it is necessary that history data about creation, change and extinction of spatial data and attribute data have to be chosen and managed. In this study, we analyze operations of updating system of digital map using as-built drawings, and suggest the history database system.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.5
• /
• pp.417-425
• /
• 2003

H.264, which is the latest video coding standard of both ITU-T(International Telecommunication Union-Telecommunication standardization sector) and MPEG(Moving Picture Experts Group), adopts new video coding tools such as variable block size motion estimation, multiple reference frames, quarter-pel motion estimation/compensation(ME/MC), 4${\times}$4 Integer DCT(Discrete Cosine Transform), and Rate-Distortion Optimization, etc. These new video coding tools provide good coding of efficiency compared with existing video coding standards as H.263, MPEG-4, etc. However, these new coding tools require the increase of encoder complexity. Therefore, in order to apply H.264 to many real applications, fast algorithms are required for H.264 coding tools. In this paper, when encoder MacroBlock(MB) mode is decided by rate-distortion optimization tool, fast mode decision algorithm by skipping variable block size ME/MC and spatial-predictive coding, which occupies most encoder complexity, is proposed. In terms of computational complexity, the proposed method runs about 4 times as far as JM(Joint Model) 42 encoder of H.264, while the PSNR(peak signal-to-noise ratio)s of the decoded images are maintained.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.44 no.2
• /
• pp.86-94
• /
• 2007

The NoC (network-on-chip) approach is a promising solution to the increasing complexity of on-chip communication problems because of its high scalability. But, NoC applications generally consume a lot of power, because they require a large design space to accommodate many parallel IPs and network communication channels. It is not easy to analyze the power consumption of NoC applications with conventional simulation methods using simple power models. In addition, there are also many limitations in using sophisticated simulation models because they require long execution time and large efforts. In this paper, we apply a cycle-accurate energy measurement technique and tool to the FPGA prototypes, which are generally used to verify the correctness of SoC designs, as a practical indication of the power consumption of real NoC applications. An NoC-based JPEG encoder implementation is used as a case study to demonstrate the effectiveness of our approach.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2011.05a
• /
• pp.141-141
• /
• 2011

생태적 기능이 담보되는 하안의 조성 및 복원은 필연적으로 하안공간에서 물리적 구조변화를 야기한다. 이러한 하안공간의 물리적 구조변화는 장기적으로 구간에서의 생태적 기능뿐만 아니라 단기적으로 하천의 수리특성변화를 야기한다. 이러한 수리특성변화는 복원구간에서의 생태적 기능에 직접적인 영향을 준다. 하천복잡도에 따른 수리특성의 변화는 자연형 하천복원에 영향을 주는 변수이므로 이들 변화를 예측할 수 있는 하천복잡도 시나리오의 수립은 매우 중요하다. 따라서 본 연구에서는 2차원 하상변동 수치모형인 CCHE2D 모형을 이용하여 하천유형에 따른 수리특성을 분석하고자 하였다. 하천복잡도 시나리오는 Rosgen (1994)에 의해 제안된 하천분류방법과 유량크기별 모의 시나리오를 작성하여 모델에 적용하였다. 연구대상지역은 안성천유역의 오산천과 진위천으로 하천분류결과 크게 C유형과 E 유형으로 분류되었다. 분류된 유형의 수리특성 분석을 위해 C 유형의 구간중 진위천 본류구간과 통삼천의 만곡구간을 선정하여 모형을 구동하였다. 모형의 입력자료인 유한요소망은 하천정비기본계획의 부도를 이용하여 생성하였으며 모델의 경계입력자료는 WMS HEC-1의 유출량 결과 자료를 사용하였다. 빈도별 강우량 자료를 Huff의 4분위 법을 적용하여 24시간으로 분포화하여 빈도별, 구간별 유출량 자료를 구축하여 모의 하였다. 선정한 하천유형구간에 대하여 유량크기별 수위, 유속, 한계유속, 소류력에 대한 흐름특성분석을 실시하였으며, 조도계수의 변화에 따른 흐름특성 변화를 분석하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.11A
• /
• pp.1167-1175
• /
• 2006

The ML-DFE(Maximum Likelihood-Decision Feedback Equalization) can be viewed as either a suboptimal signal detection method for reducing hardware complexity of ML or an enhanced detection method for reducing the effect of error propagation of SIC(Successive Interference Cancellation) in spatially multiplexed MIMO systems such as V-BLAST. The ML-DFE can achieve a higher diversity in rich scattering environments as well as reducing the error propagation effect by combing ML decoding with the DFE. In this paper, an MML-DFE(Modified Maximum Likelihood-Decision Feedback Equalization) is proposed to reduce the hardware complexity of the ML-DFE, without compromising performance. It is shown by FPGA implementation that the proposed MML-DFE can achieve the same performance as the ML-DFE with significantly reduced hardware complexity.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.7_8
• /
• pp.341-351
• /
• 2003

For debugging effectively the shared-memory programs with nested parallelism, it is important to detect efficiently the first races which incur non-deterministic executions of the programs. Previous on-the-fly technique detects the first races in two passes, and shows inefficiencies both in execution time and memory space because the size of an access history for each shared variable depends on the maximum parallelism of program. This paper proposes a new on-the-fly technique to detect the first races in two passes, which is constant in both the number of event comparisons and the space complexity on each access to shared variable because the size of an access history for each shared variable is a small constant. This technique therefore makes on-the-fly race detection more efficient and practical for debugging shared-memory programs with nested parallelism.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.14 no.5
• /
• pp.863-870
• /
• 2019

In the GSM method for OWC-MIMO System, it is important to select an activation pattern set(: APS) for the performance optimization in the environment where mutual interference is high depending on the location of the transmitter and receiver. However, due to the high computational complexity, a high cost is paid in selecting the transmission APS. In this paper, we propose a method to reduce the candidate APS by pre-determining basic APS when generating candidate APS. The simulation results show that the proposed method has the same BER performance and reduce the computational complexity by 90% compared to the general GSM method in the high interfering environment.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.15 no.9
• /
• pp.848-855
• /
• 2004

In this paper, we propose a new channel identification technique for long code DS/CDMA DMB down link system which estimate the channel response based on the signal space vector only, unlike the most conventional subspace method relying on the orthogonal property of noise space vectors to the signal space vector. Because of this property of the proposed method, it is optimum and practical in manipulation of the covariance matrix to be analyzed. In the paper, we derive the mathematical expression necessary to clarify the proposed method and show the relevant simulation and numerical results to verify the validity of the proposed algorithm.

• Spatial Information Research
• /
• v.6 no.2
• /
• pp.125-132
• /
• 1998

The I/O performance for spatial queries is extremely important since the handling of huge amount of multidimensional data is required in spatial databases for geographic information systems. Therefore, we describe representative spatial access methods handling complex spatial objects, z-transform B tree, KDB tree, R tree, MAX tree, to increase I/O performance. In addition, we measure the performance of spatial indexing schemes by testing against various realistic data and query sets. Results from the benchmark test indicates that MAX outperforms other indexing schemes on insertion, range query, spatial join. MAX tree is expected to use as index scheme organizing storage system of GIS in the future.

• Spatial Information Research
• /
• v.15 no.3
• /
• pp.311-322
• /
• 2007

Geovisual analytics is the new research area that looks fur the way to enable a truly synergetic work of human and visualization tool in analyzing spatio-temporal data. The research challenge for geovisual analytics is developing new geovisualization tools and enhancing human capabilities to analyse, envision, and reason a lot of spatio-temporal changes. With this research area, geovisual analytics is expected to be a new methodology for developing spatial decision support tools. This research is to integrate T scatter plot with computational method to classify the several patterns of the regional fright generation in Korea. The result of this work shows the capabilities provided by geovisual analytics to support spatial decision making.