• Journal of the Korea Society of Computer and Information
• /
• v.15 no.6
• /
• pp.1-9
• /
• 2010

This paper proposes a test method for compliance of SMS encoder and decoder modules with 3GPP (3rd Generation Partnership Project) specification on SMS PDU (Protocol Data Unit). The existing tools have focused on providing an SMS gateway and on helping to view and edit a single SMS PDU, which rarely help to resolve the compliance test problem. The proposed compliance test method is based on an automatic generation of SMS PDUs fully compliant with the 3GPP specification by using QuickCheck library written in Haskell. By applying the proposed method to a C-based SMS encoder and decoder in Linux Mobile platform, we have found out several critical bugs such as wrong interpretation of time stamps in BCD format. The automatic SMS PDU generator is reusable in that it only depends on the 3GPP SMS specification. The QuickCheck library is also applicable for testing other network protocol data encoders and decoders, as used in this paper.

• Journal of Communications and Networks
• /
• v.10 no.4
• /
• pp.371-383
• /
• 2008

Application of network coding in wireless two-way relay channels (TWRC) has received much attention recently because its ability to improve throughput significantly. In traditional designs, network coding operates at upper layers above (including) the link layer and it requires the input packets to be correctly decoded. However, this requirement may limit the performance and application of network coding due to the unavoidable fading and noise in wireless networks. In this paper, we propose a new wireless network coding scheme for TWRC, which is referred to as soft network coding (SoftNC), where the relay nodes applies symbol-by-symbol soft decisions on the received signals from the two end nodes to come up with the network coded information to be forwarded. We do not assume further channel coding on top of SoftNC at the relay node (channel coding is assumed at the end nodes). According to measures of the soft information adopted, two kinds of SoftNC are proposed: amplify-and-forward SoftNC (AF-SoftNC) and soft-bit-forward SoftNC (SBF-SoftNC). We analyze the both the ergodic capacity and the outage capacity of the two SoftNC schemes. Specifically, analytical form approximations of the ergodic capacity and the outage capacity of the two schemes are given and validated. Numerical simulation shows that our SoftNC schemes can outperform the traditional network coding based two-way relay protocol, where channel decoding and re-encoding are used at the relay node. Notable is the fact that performance improvement is achieved using only simple symbol-level operations at the relay node.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.5B
• /
• pp.379-385
• /
• 2008

For the sharing and exchange of information between medical clinics, the clinical document has to be built on a standardized protocol such as a HL7-CDA. But it is difficult to exchange information between medical clinics because clinical document such as electronic medical record that include text and image, have different structure of document and type of expression. In this paper, we propose the electronic medical record system based on HL7-CDA that can share and exchange clinical information between medical institute. For this purpose, we have to design the schema of the clinical document architecture after we select the essential items of medical record and define templates. The proposed system can minimize integrating process and save parsing time when clinical information exchange and refer, by converting electronic medical record to base64 encoding scheme and integrate it in a XML document.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.3
• /
• pp.671-680
• /
• 1998

Network services, such as teleconferencing, remote diagnostics and education, and CSCW require multicasting. Multicast routing methods can be divided into two categories. One is the shortest path tree method and the other is the minimal Steiner tree method. The latter has an advantage over the former in that only one Steiner tree is needed for a group. However, finding a minimal Steiner tree is an NP-complete problem and it is necessary to find an efficient heuristic algorithm. In this paper, we present an evolutionary optimization method for finding minimal Steiner trees without sacrificing too much computational efforts. In particular, we describe a tree-based genetic encoding scheme which is in sharp constast with binary string representations usually adopted in convetional genetic algorithms. Experiments have been performed to show that the presented method can find optimal Steiner trees for given vetwork configurations. Comparitivie studies have shown that the evolutionary method finds on average a better solution than other conventional heustric algorithms.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.2
• /
• pp.352-358
• /
• 2004

This paper is studied the improvement of performance for moving picture encoder using H.263. This is used the new motion vector search algorithm using a relation with neighborhood search point and is applied the integer DCT for the encoder. The integer DCT behaves DCT by the addition operation of the integer using WHT and a integer lifting than conventional DCT that needs the multiplication operation of a floating point number. Therefore, the integer Dn can reduce the operation amount than basis DCT with having an equal PSNR. The new motion vector search algorithm is showed almost similar PSNR as reducing the operation amount than the conventional motion vector search algorithm. To experiment a compatibility of the integer DCT and the conventional DCT, according to result compare case that uses a method only and case that uses the alternate two methods of the integer DCT or the conventional DCT to H.263 encoder and decoder, case that uses the alternate two methods is showed doing not deteriorate PSNR-and being each other compatible visually than case that uses an equal method only.

• Journal of KIISE
• /
• v.42 no.9
• /
• pp.1078-1089
• /
• 2015

In this paper, we propose the Min-hash Assisted Delta-compression Engine(MADE) to improve the lifetime of NAND flash-based storages at the device level. MADE effectively reduces the write traffic to NAND flash through the use of a novel delta compression scheme. The delta compression performance was optimized by introducing min-hash based LSH(Locality Sensitive Hash) and efficiently combining it with our delta compression method. We also developed a delta encoding technique that has functionality equivalent to deduplication and lossless compression. The results of our experiment show that MADE reduces the amount of data written on NAND flash by up to 90%, which is better than a simple combination of deduplication and lossless compression schemes by 12% on average.

• Journal of Korea Multimedia Society
• /
• v.11 no.7
• /
• pp.956-965
• /
• 2008

H.264/AVC is the newest video coding standard of ITU-T VCEG and the ISO/IEC MPEG, offering a significant performance improvement over previous video coding standards. However, the computational complexity of H.264/AVC is drastically increased because of new technologies such as intra prediction, variable block size, quarter-pels motion estimation/compensation, etc. In this paper, we propose a fast intra prediction scheme which has two step processing. The first step is a fast block size decision which can be calculated only in one block without considering all cases of $4{\times}4$ block and $16{\times}16$ block. The complexity of the intra prediction can be reduced by using boundary difference values of macroblock. After selecting the block size, we can make mode decision using the neighbouring reference pixels and representative pixels of the block in the second step. The experimental results show that the proposed algorithm saved on the average 41.5% encoding time without any significant PSNR losses.

• Journal of Korea Multimedia Society
• /
• v.7 no.1
• /
• pp.12-26
• /
• 2004

In the past, geographic data is constructed and serviced through independent formats of its own according to each GIS(Geographic Information System). Recently the provision of interoperability in GIS is important to efficiently apply the various geographic data between conventional GIS's. Whereupon OGC(Open GIS Consortium) proposed GML(Geography Markup Language) to offer the interoperability between heterogeneous GISs in distributed environments. The GML is an XML encoding for the transport and storage of geographic information, including both the spatial and non-spatial properties of geographic features. Also, the GML includes Web Map Server Implementation Specification to service the GML documents. Accordingly the prototype to provide the reciprocal interchange of geographic information between conventional GIS's and GML documents is widely studied. In this paper, we propose a mapping method of geographic in formation between spatial database and GML for the prototype to support the interoperability between heterogeneous geographic information. For this method, firstly the scheme of converting geographic in Formation of the conventional spatial database into the GML document according to the GML specification is explained, and secondly the scheme to transform geographic information of GML documents to geographic data of spatial database is showed. Consequently, the proposed method is applicable to the framework for integrated geographic information services based on Web by making an offer the interoperability between already built geographic information of conventional GIS's using a mapping method of geographic information between spatial database and GML.

• Korean Journal of Optics and Photonics
• /
• v.16 no.4
• /
• pp.326-333
• /
• 2005

Phase-only encryption scheme using exclusive-OR rules in Fourier plane and a single path decryption system are presented. A zero-padded original image, multiplied by a random phase image, is Fourier transformed and its real-valued data is encrypted with key data by using XOR rules. A decryption is simply performed based on 2-1 setup with spatial filter by Fourier transform for multiplying phase-only encrypted data by phase-only key data, which are obtained by phase-encoding process, and spatial filtering for zero-order elimination in inverse-Fourier plane. Since the encryption process is peformed in Fourier plane, proposed encryption scheme is more tolerant to loss of key information by scratching or cutting than previous XOR encryption method in space domain. Compare with previous phase-visualization systems, due to the simple architecture without a reference wave, our system is basically robust to mechanical vibrations and fluctuations. Numerical simulations have confirmed the proposed technique as high-level encryption and simple decryption architecture.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.12C
• /
• pp.1173-1183
• /
• 2006

In this paper, we propose an efficient method for improving visual quality of AR-FGS (Adaptive Reference FGS) which is adopted as a key scheme for SVC (Scalable Video Coding) or H.264 scalable extension. The standard FGS (Fine Granularity Scalability) adopts AR-FGS that introduces temporal prediction into FGS layer by using a high quality reference signal which is constructed by the weighted average between the base layer reconstructed imageand enhancement reference to improve the coding efficiency in the FGS layer. However, when the enhancement stream is truncated at certain bitstream position in transmission, the rest of the data of the FGS layer will not be available at the FGS decoder. Thus the most noticeable problem of using the enhancement layer in prediction is the degraded visual quality caused by drifting because of the mismatch between the reference frame used by the FGS encoder and that by the decoder. To solve this problem, we exploit the principle of cyclical block coding that is used to encode quantized transform coefficients in a cyclical manner in the FGS layer. Encoding block coefficients in a cyclical manner places 'higher-value' bits earlier in the bitstream. The quantized transform coefficients included in the ealry coding cycle of cyclical block coding have higher probability to be correctly received and decoded than the others included in the later cycle of the cyclical block coding. Therefore, we can minimize visual quality degradation caused by bitstream truncation by adjusting weighting factor to control the contribution of the bitstream produced in each coding cycle of cyclical block coding when constructing the enhancement layer reference frame. It is shown by simulations that the improved AR-FGS scheme outperforms the standard AR-FGS by about 1 dB in maximum in the reconstructed visual quality.