• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.6
• /
• pp.99-110
• /
• 2005

These days, many image processing techniques have been studied for effective image compression. Among those, The 2D image filtering is widely used for 2D image processing. The 2D image filtering can be implemented by performing the 1D linear filter separately in the horizontal and vertical direction. Efficiency of image compression depends on what filtering method is used. Generally, circular convolution is widely used in 2D image filtering for image processing. However it doesn't consider correlations at the boundary region of image, therefore effective filtering can not be performed. To solve this problem. I proposed new convolution technique using loop convolution which satisfies the 'alias-free' and 'error-free' requirement in the reconstructed image. This method could provide more effective compression performance than former methods because it used highly-correlated data when performed at the boundary region. In this paper, Sub-band Coding(SBC) was adopted to analyze efficiency of proposed filtering technique, and the simulator developed by Java-based language was used to examine the performance of proposed method.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.2
• /
• pp.193-201
• /
• 2008

Using Network Coding in P2P systems yields great benefits, e.g., reduced download delay. The core notion of Network Coding is to allow encoding and decoding at intermediate nodes, which are prohibited in the traditional networking. However, improper implementation of Network Coding may reduce the overall performance of P2P systems. Network Coding cannot work with general arithmetic operations, since its arithmetic is over a Finite Field and the use of an efficient Finite Field arithmetic algorithm is the key to the performance of Network Coding. Also there are other important performance parameters in Network Coding such as Field size. In this paper we study how those factors influence the performance of Network Coding based systems. A set of experiments shows that overall performance of Network Coding can vary 2-5 times by those factors and we argue that when developing a network system using Network Coding those performance parameters must be carefully chosen.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.7B
• /
• pp.517-527
• /
• 2012

This paper considers a cooperative communication system with a single relay node, where two-layer superposition coding and successive decoding is employed to reduce the expected distortion of a Gaussian source delivered. For the system, we propose a relay scheme which forwards an appropriate relay signal at the relay node, based on the local decoding result of layers and the decoding result of layers at the destination node fed back to the relay node. In the scheme, the relay signal is designed not only by applying decode-and-forward but also by applying amplify-and-forward to reduce the outage probability in final decoding of each layer. The performance of the proposed scheme is evaluated numerically in terms of the expected distortion at various relay locations using outage probabilities derived. The results show that the proposed scheme outperforms the conventional schemes in most cases of the relay location and the gain gets larger when the relay node is closer to the source node in particular.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.12C
• /
• pp.1014-1020
• /
• 2008

Storage devices such as memories are widely used in various electronic products. They require high-density memory and currently the data has been stored in multi-level format, that results in high error rate. In this paper, we apply error correction schemes that are widely used in communication system to the storage devices for satisfying low bit error rate and high code rate. In A WGN channel with average BER $10^{-5}$ and $5{\times}10^{-6}$, we study error correction schemes for 4-1evel cell to achieve target code rate 0.99 and target BER $10^{-11}$ and $10^{-13}$, respectively. Since block codes may perform better than the concatenated codes for high code rate, and it is important to use less degraded inner code even when many bits are punctured. The performance of concatenated codes using general feedforward systematic convolutional codes are worse than the block code only scheme. The simulation results show that RSC codes must be used as inner codes to achieve good performance of punctured convolutional codes for high code rate.

• Journal of the Korean Home Economics Association
• /
• v.47 no.5
• /
• pp.23-34
• /
• 2009

The purpose of this study was to e${\times}$amine the effect of visual imagery stimulated by product information on consumer responses in online shopping conte${\times}$ts. Dual coding theory provided the theoretical framework of the study. The proposed model of the study was e${\times}$amined by conducting an e${\times}$periment using mock apparel websites with a between-subject factorial design: [2 (pictorial information: detailed views vs. no detailed views) ${\times}$ 2 (verbal information: detailed descriptions vs. abstract descriptions)]. A total of 439 female college students participated in the e${\times}$periment, and 433 responses were ultimately used to test the hypotheses. The findings from the results revealed: (1) the main effects of the pictorial and verbal information on visual imagery, and (2) positive relationships between (a) visual imagery and mood, (b) visual imagery and perceived product quality, (c) mood and perceived product quality, and (d) perceived quality and purchase intentions.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.8
• /
• pp.1854-1863
• /
• 2003

In the recent digital communication systems, the performance of Turbo Code using the mr correction coding depends on the interleaver influencing the free distance determination and the recursive decoding algorithms that is executed in the huh decoder. However, performance depends on the interleaver depth that needs many delays over the reception process. Moreover, turbo code has been blown as the robust coding methods with the confidence over the fading channel. International Telecommunication Union(ITU) has recently adopted it as the standardization of the channel coding over the third generation mobile communications(IMT­2000). Therefore, in this paper, we preposed the interleaver that has the better performance than existing block interleaver, and modified turbo decoder that has the parallel concatenated structure using MAP algorithm. In the real­time voice and video service over third generation mobile communications, the performance of the proposed two methods was analyzed and compared with the existing methods by computer simulation in terms of reduced decoding delay using the variable decoding method over AWGN and fading channels for CDMA environments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.2
• /
• pp.163-171
• /
• 2016

In order to detect the exact position of high-speed train, it is necessary to obtain location information from the transponder tag installed along the track. In this paper, we proposed parallel descrambling scheme for high-speed railway transponder system, which aims for reducing the processing time required to decode telegram. Since a telegram is stored in a tag after information bits are scrambled by an encoder, decoding procedure includes descrambling of received telegram to recover the original information bits. By analyzing the structure of the descrambling shift register circuit, we proposed a parallel descrambling scheme for fast decoding of telegram. By comparing the required number of clocks, it is shown that the proposed scheme significantly outperforms the original one.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2000.12a
• /
• pp.13-16
• /
• 2000

In the recent mobile communication systems, the performance of Turbo Code using the error correction coding depends on the interleaver influencing the free distance determination and the recursive decoding algorithms that is executed in the turbo decoder. However, performance depends on the interleaver depth that need great many delay over the reception process. Moreover, Turbo Code has been known as the robust coding methods with the confidence over the fading channel. The International Telecommunication Union(ITU) has recently adopted as the standardization of the channel coding over the third generation mobile communications the same as IMT-2000. Therefore, in this paper, we proposed of that has the better performance than existing Turbo Decoder that has the parallel concatenated four-step structure using MAP algorithm. In the real-time voice and video service over the third generation mobile communications, the performance of the proposed method was analyzed by the reduced decoding delay using the variable decoding method by computer simulation over AWGN and lading channels.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.8
• /
• pp.18-24
• /
• 2017

The process of transmitting messages through a medium with a limited bandwidth or channel dispersion inevitably involves signal distortion and noise influxes, resulting in the degradation of transmission quality due to the inter-symbol interference and additional noise, which increases the error rate of the received symbols. The main role of the equalizer is to remove the channel distortion and noise from the received signal to recover the transmitted messages. A number of studies on the equalizer composed of a combination of linear filter and error control coding have shown that they played a key role in enhancing the transmission efficiency, which is essential for digital communication. This paper proposes a new algorithm to correct the residual symbol errors in the message signal. In general, equalizer performance improvement algorithms were developed to improve the initial convergence speed or steady-state error. In this paper, however, the equalizer input signal was reconstructed using the equalizer decision symbols and the channel estimates to directly correct the decision errors by analyzing the statistical characteristics of the difference signal between the actual received signal and the reconstructed signal.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.3
• /
• pp.541-546
• /
• 2004

Space-Time Coding(STC) is a technique that utilizes joint correlation of transmitted signals in both time and space domains. Through this approach, diversity and coding gains can be simultaneously obtained. In this paper, we use SPW simulation tool to implement the IEEE 802.11a system. Based on this system, OFDM system with STC and convolutional coder concatenated is implemented. The system performance is analyzed and compared with the performance of the IEEE 802.11a system. The simulation results show that the performance with concatenated codes at a data rate of 6Mbps shows approximately a 5dB gain over the system with the convolutional code only. At a data rate of 12Mbps, the performance with concatenated codes is further improved by approximately 6dB.