• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.3
• /
• pp.6-12
• /
• 2011

The fast growing of the number of users requires the development of reliable communication systems able to provide higher data rates. In order to meet those requirements, techniques such as Multiple Input Multiple Out (MIMO) and Orthogonal Frequency Division multiplexing (OFDM) have been developed in the recent years. In order to combine the benefits of both techniques, the research activity is currently focused on MIMO-OFDM systems. In addition, for a fast wireless channel environment, the data rate and reliability can be optimized by setting the modulation and coding adaptively according to the channel conditions; and using sub-carrier frequency, and power allocation techniques. Depending on how accurate the feedback-based system obtain the channel state information (CSI) and feed it back to the transmitter without delay, the overall system performance would be poor or optimal. In this paper, we propose a Signal to Noise Ratio (SNR) estimation algorithm where the preamble is known for both sides of the transciever. Through simulations made over several channel environments, we prove that our proposed SNR estimation algorithm is more accurate compared with the traditional SNR estimation.

• Korean Journal of Remote Sensing
• /
• v.38 no.6_1
• /
• pp.1343-1356
• /
• 2022

Clouds or shadows are the most problematic when monitoring crops using optical satellite images. To reduce this effect, a composite algorithm was used to select the maximum Normalized Difference Vegetation Index (NDVI) for a certain period. This Maximum NDVI Composite (MNC) method reduces the influence of clouds, but since only the maximum NDVI value is used for a certain period, it is difficult to show the phenomenon immediately when the NDVI decreases. As a way to maintain the spectral information of crop as much as possible while minimizing the influence of clouds, a Score-Based Composite (SBC) algorithm was proposed, which is a method of selecting the most suitable pixels by defining various environmental factors and assigning scores to them when compositing. In this study, the Sentinel-2A/B Level 2A reflectance image and cloud, shadow, Aerosol Optical Thickness(AOT), obtainging date, sensor zenith angle provided as additional information were used for the SBC algorithm. As a result of applying the SBC algorithm with a 15-day and a monthly period for Dangjin rice fields and Taebaek highland cabbage fields in 2021, the 15-day period composited data showed faster detailed changes in NDVI than the monthly composited results, except for the rainy season affected by clouds. In certain images, a spatially heterogeneous part is seen due to partial date-by-date differences in the composited NDVI image, which is considered to be due to the inaccuracy of the cloud and shadow information used. In the future, we plan to improve the accuracy of input information and perform quantitative comparison with MNC-based composite algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11B
• /
• pp.1283-1288
• /
• 2009

In general, a 3D computer graphic model is being used to generate a digital hologram as theinput information because the 3D information of an object can be extracted from a 3D model, easily. The 3D information of a real scene can be extracted by using a depth camera. The 3D information, point cloud, corresponding to real scene is extracted from a taken image pair, a gray texture and a depth map, by a depth camera. The extracted point cloud is used to generate a digital hologram as input information. The digital hologram is generated by using the coherent holographic stereogram, which is a fast digital hologram generation algorithm based on segmentation. The generated digital hologram using the taken image pair by a depth camera is reconstructed by the Fresnel approximation. By this method, the digital hologram corresponding to a real scene or a real object could be generated by using the fast digital hologram generation algorithm. Furthermore, experimental results are satisfactory.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.4
• /
• pp.1042-1058
• /
• 2024

Terahertz (THz) communication is becoming a key technology for future 6G wireless networks because of its ultra-wide band. However, the implementation of THz communication systems confronts formidable challenges, notably beam splitting effects and high computational complexity associated with them. Our primary objective is to design a hybrid precoder that minimizes the Euclidean distance from the fully digital precoder. The analog precoding part adopts the delay-phase alternating minimization (DP-AltMin) algorithm, which divides the analog precoder into phase shifters and time delayers. This effectively addresses the beam splitting effects within THz communication by incorporating time delays. The traditional digital precoding solution, however, needs matrix inversion in THz massive multiple-input multiple-output (MIMO) communication systems, resulting in significant computational complexity and complicating the design of the analog precoder. To address this issue, we exploit the characteristics of THz massive MIMO communication systems and construct the digital precoder as a product of scale factors and semi-unitary matrices. We utilize Schatten norm and Hölder's inequality to create semi-unitary matrices after initializing the scale factors depending on the power allocation. Finally, the analog precoder and digital precoder are alternately optimized to obtain the ultimate hybrid precoding scheme. Extensive numerical simulations have demonstrated that our proposed algorithm outperforms existing methods in mitigating the beam splitting issue, improving system performance, and exhibiting lower complexity. Furthermore, our approach exhibits a more favorable alignment with practical application requirements, underlying its practicality and efficiency.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.9
• /
• pp.3745-3761
• /
• 2020

Low-rank representation methods already achieve many applications in the image reconstruction. However, for high-gradient image patches with rich texture details and strong edge information, it is difficult to find sufficient similar patches. Existing low-rank representation methods usually destroy image critical details and fail to preserve edge structure. In order to promote the performance, a new representation-based image super-resolution reconstruction method is proposed, which combines gradient domain guided image filter with the structure-constrained low-rank representation so as to enhance image details as well as reveal the intrinsic structure of an input image. Firstly, we extract the gradient domain guided filter of each atom in high resolution dictionary in order to acquire high-frequency prior information. Secondly, this prior information is taken as a structure constraint and introduced into the low-rank representation framework to develop a new model so as to maintain the edges of reconstructed image. Thirdly, the approximate optimal solution of the model is solved through alternating direction method of multipliers. After that, experiments are performed and results show that the proposed algorithm has higher performances than conventional state-of-the-art algorithms in both quantitative and qualitative aspects.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.12
• /
• pp.537-546
• /
• 2014

The purpose of this study is to develope an algorithm which generates trip plans based on rating points of travel app users and travel experts to help potential travellers experience their desired destinations in advance. This algorithm uses the above rating points and the gradually created hierarchy to generate the most preferred and efficient trip courses. Users can go through video clips or panoramic VR videos of the actual destinations from their trip plans generated by the algorithm which may add excitement to their actual trips. With our heuristic methods, the more users input their ratings, the better trip plans can be generated. This algorithm has been tested on android OS and proven efficient in generating trip plans. This research introduces a way to experience travel destinations with panoramic VR video and proposes the algorithm which generates trip plans based on users' ratings. It is expected to be useful for travellers' trip planning and to contribute growth in the travel market.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.4
• /
• pp.113-120
• /
• 2004

In this paper, we propose an efficient feature extraction and image retrieval algorithm for content-based retrieval method. First, we extract the object using Gaussian edge detector for input image which is key frames of MPEG video and extract the object features that are location feature, distributed dimension feature and invariant moments feature. Next, we extract the characteristic color feature using the proposed HAQ(Histogram Analysis md Quantization) algorithm. Finally, we implement an retrieval of four features in sequence with the proposed matching method for query image which is a shot frame except the key frames of MPEG video. The purpose of this paper is to propose the novel content-based image retrieval algerian which retrieves the key frame in the shot boundary of MPEG video belonging to the scene requested by user. The experimental results show an efficient retrieval for 836 sample images in 10 music videos using the proposed algorithm.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.6
• /
• pp.20-29
• /
• 1998

This paper proposes the algorithms that design the highly parallel multiple-valued logic curcuit and assign the code to each node of DCG(Directed Cyclic Graph) of length 1. The conventional Nakajima's algorithm have some problems, so this paper introduce the matrix equation from DCG of length 1 and proposes circuit design algorithms according to the DCG of length 1. Using the proposed circuit design algorithms in this paper, it become realized that was not able to design from Nakajima's algorithm. Also, making a comparision between the circuit design using Nakajima's algorithm and this paper's, we testify that proposed paper's algorithm is able to realize more optimized circuit design. According to proposed curcuit design algorithm in this paper, it is possible to design curcuit that DCG have natural number, so it have the following advantages; reduction of the curcuit input/output digits, simplification of curcuit composition, reduction of computation time and cost. And we show compatibility and verification about this paper's algorithm.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.45 no.10
• /
• pp.75-82
• /
• 2008

In this paper, we propose an efficient symbol detection algorithm for multiple-input multiple-output spatial multiplexing (MIMO-SM) systems and present its design and implementation results. By enhancing the performance of the first detected symbol which causes error propagation, the proposed algorithm achieves a considerable performance gain as compared to the conventional sorted QR decomposition (SQRD) based detection and the ordered successive detection (OSD) algorithms. The bit error rate (BER) performance of the proposed detection algorithm is evaluated by the simulation. In case of 16QAM MIMO-SM system with 4 transmit and 4 receive ($4{\times}4$) antennas, at $BER=10^{-3}$ the proposed algorithm obtains the gai improvement of about 2.5-13.5 dB over the conventional algorithms. The proposed detection algorithm was designed in a hardware description language (HDL) and synthesized to gate-level circuits using 0.18um 1.8V CMOS standard cell library. The results show that the proposed algorithm can be implemented without increasing the hardware costs significantly.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.9
• /
• pp.1-10
• /
• 1998

This paper is to propose an algorithm named as DYSAC to find the critical path(the longest sensitizable path) in a large digital circuit, whose purpose is to reduce the time to find critical path and to find critical paths of the circuits for which the previous methods could not find one. Also a set of path sensitization criteria named as DYPSEC is proposed, which is used to select a path from input to the output inside the DYSAC. The DYSAC consists of two sub-algorithms; the level assignment algorithm to assign a level to each node and the critical path selection algorithm to select the sensitizable path. The proposed algorithm was implemented with C-language on SUN Sparc and applied to the ISCAS'85 benchmark circuits to make sure if it works correctly and finds the correct critical path. Also, the results from the experiments were compared to the results from the previous works. The comparison items were the ability to find the critical path and the speed, in both of which the proposed algorithm in this paper shows better results than others.