• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.4C
• /
• pp.191-199
• /
• 2005

Space-time turbo codes have been studied extensively as a powerful and bandwidth efficient error correction code over the wireless communication environment. In this paper, the efficient algorithm for decoding space-time turbo codes is proposed. The proposed method reduces the computational complexity by approximating a prior information for a iterative decoder. The performance of space-time turbo codes is also analyzed by using the fixed point implementation and the efficient method for approximating the Log-MAP algorithm is proposed. It is shown that the BER performance of the proposed method is close to that of the Log-MAP algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.3A
• /
• pp.151-156
• /
• 2012

In this paper, design of quasi-cyclic(QC) low-density parity-check codes is proposed to have full diversity for space-time bit-interleaved coded modulation(ST-BICM) systems. Necessary and sufficient conditions that the proposed scheme has full diversity are proved as the condition that submatrices corresponding to the system part of codewords are invertible. And new construction method of binary invertible matrices for QC LDPC codes in ST-BICM systems are also proposed and modification for parity-check matrices are also explained.

• Journal of KIISE:Databases
• /
• v.31 no.1
• /
• pp.39-47
• /
• 2004

Spatio-temporal databases have been mostly studied in the area of access methods. However, without considering an extraordinary update maintenance overhead after building up a spatio-temporal index, most indexing techniques have focused on fast query processing only. In this paper, we propose an efficient update management method that reduces the number of disk accesses required in order to apply the updates of moving objects to a spatio-temporal index. We consider realistic update patterns that can represent the movements of objects properly. We present a memory based structure that can efficiently maintain a small number of very frequently updating objects. For an experimental environment with realistic update patterns, the number of disk accesses of our method is about 40% lower than that of a general update method of existing spatio-temporal indexes.

• Journal of Digital Contents Society
• /
• v.15 no.4
• /
• pp.527-532
• /
• 2014

Recently, due to the proliferation of mobile smart devices, the inovation of bigdata, which analyzes and processes massive data collected from various sensors implaned in smart devices, expands to LBSs. Many location prediction techniques for moving objects have been studied in literature. However, as the majority of studies perform location prediction which depends on specific applications, they hardly reflect the technical requirements of next-generation spatio-temporal information services. Therefore, this paper proposes the design of general-purpose distributed moving object prediction query processing framework that is capable of performing primitive and various types of queries effectively based on massive spatio-temporal data of moving objects in real-world space networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.6C
• /
• pp.561-569
• /
• 2003

In this paper, for my linear orthogonal space-time block including the orthogonal space-time codes introduced by Alamouti［1］, Tarokh［14］, and Xia［11］, the exact expression for the pairwise error probability in the slow Rayleigh fading channel is derived in terms of the message symbol distance between two message vectors rather than the codeword symbol distance between two transmitted codeword matrices. Using the one-dimensional component symbol error probability, the exact closed form expressions for the symbol error probability of linear orthogonal space-time codes are derived for QPSK, 16-QAM, 64-QAM, and 256-QAM.

• Journal of Korea Spatial Information System Society
• /
• v.2 no.2 s.4
• /
• pp.127-142
• /
• 2000

GIS Tools is able to not only store the integrated information between attribute data and spatial data, but also analyze them. Most of GIS Tools support current information of land. However, lawsuit of right of possession as well as statistic of past data for land policy may need historical information. Therefore, in the paper, we designed the spatiotemporal operators what can handle the historical information. and implemented them. The spatiotemporal operators are used in the history management system of Cadastre and Cadastral map based on GIS. The historical information is generated in spatial operation of spatiotemporal operators and then the implemented operators provide a function to store the historical information, and handle them.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.10
• /
• pp.2188-2194
• /
• 2011

With the development of wireless network technology, Storing the location information of a spatiotemporal object was very necessary. Each spatiotemporal object has many unnecessariness location information, hence it is inefficient to search all trajectory information of spatiotemporal objects. In this paper, we propose an efficient method which increase searching efficiency. Using EMBR(Extend Minimun Bounding Rectangle), an LinearMarge split algorithm that minimizes the volume of MBRs is designed and simulated. Our experimental evaluation confirms the effectiveness and efficiency of our proposed splitting policy.

• Journal of Satellite, Information and Communications
• /
• v.5 no.2
• /
• pp.40-44
• /
• 2010

A layered coding scheme is one of the adaptive receiving techniques for unidirectional services such as multimedia broadcasting and multicasting services (MBMS), where we cannot utilize feedback information. The layered coding scheme can be used with hierarchical modulations by combining suitable code rates and modulation orders of each. In addition, it has been reported that hybrid and/or integrated satellite systems can effectively achieve transmit diversity gains by appropriate utilization of space time coding combined with turbo codes. This paper proposes a layered turbo coding schemes for hybrid and/or integrated satellite systems. We first introduce the system architecture and operational principle of the proposed scheme, and discuss the applicability.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.1
• /
• pp.54-61
• /
• 2009

This paper presents a new electromyogram (EMG) pattern recognition method based on the Hierarchical Temporal Memory (HTM) algorithm which is originally devised for image pattern recognition. In the modified HTM algorithm, a simplified two-level structure with spatial pooler, temporal pooler, and supervised mapper is proposed for efficient learning and classification of the EMG signals. To enhance the recognition performance, the category information is utilized not only in the supervised mapper but also in the temporal pooler. The experimental results show that the ten kinds of hand motion are successfully recognized.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.7A
• /
• pp.629-634
• /
• 2002

The next generation of wireless communication system is expected to provide users with wireless multimedia services such as high speed internet access and wireless mobile computing. Depending on the Quality of Service(QoS) requirements and different applications per user, many wireless communication systems have been proposed. The simple decoding algorithm of space-time block coding is based on the assumption of flat fading channel, where no intersymbol interference exists. In this paper, we propose to combine space-time transmit diversity with adaptive equalizer. The proposed system effectively eliminates interference caused by multipath environment. Simulation results show that the proposed system provides improved bit error rate performance.