• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.9 no.2
• /
• pp.60-67
• /
• 2010

In the ubiquitous age, applications of wireless personal area network (WPAN) technology using LEDs are in progress. However, visible light communications (VLC) using the LEDs have weakness which deteriorate performance of communication because of multi-path fading that occurs propagation delay by interior walls or other things in indoor environments. In this paper, orthogonal frequency division multiplexing (OFDM) scheme is adapted to decrease multi-path fading and multi-path dispersion and to provide high speed data transmission. Besides, to reduce information losses caused by optical noise (incandescent lamps, fluorescent lamps, sunbeam etc.) also proposed channel coding using turbo codes. The encoding and decoding of the proposed system is described, and simulation results are analyzed. We can know that performance of proposed system is increased about 4 [dB] through the simulation results. Also, when the system take doppler effect, the system performance worsened.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.4
• /
• pp.165-172
• /
• 2002

In the next generation mobile communications, powerful channel coding is essential in order to obtain high quality multimedia services. Turbo code can achieve good error performance by iterative decoding, but more iterations result in additional computational complexity and delay. Thus, a method to reduce the number of iterations without additional performance degradation is needed. Turbo code with CRC is known to be the most efficient method to reduce the number of iterations. In this scheme, the performance may be degraded by the edge-effect like the conventional turbo code without CRC. In this paper, a method to eliminate the edge-effect is proposed by adopting D-parameter to the conventional s-random interleaver. As results of simulation, the edge-effect of the turbo code with CRC is shown to be successfully eliminated by using the new interleaver designed with D-parameter.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.3
• /
• pp.142-148
• /
• 2008

Though a deblocking filter of H.264/AVC provides enhanced image quality by removing blocking artifact on block boundary, the complex filtering operation on this process is a dominant factor of the whole decoding time. In this paper, we designed an ASIP to accelerate deblocking filter operation with the proposed instruction set. We designed a processor based on a MIPS structure with LISA, simulated a deblocking later model, and compared the execution time on the proposed instruction set. In addition, we generated HDL model of the processor through CoWare's Processor Designer and synthesized with TSMC 0.25um CMOS cell library by Synopsys Design Compiler. As the result of the synthesis, the area and delay time increased 7.5% and 3.2%, respectively. However, due to the proposed instruction set, total execution performance is improved by 18.18% on average.

• Journal of Advanced Marine Engineering and Technology
• /
• v.40 no.1
• /
• pp.45-49
• /
• 2016

The performance of underwater acoustic communication systems is sensitive to inter-symbol interference caused by delay spread developed from multipath signal propagation. The multipath nature of underwater channels causes signal distortion and error floor. In order to improve the performance, it is necessary to employ an iterative coding scheme. Of the various iterative coding schemes, turbo code and convolutional code based on the BCJR algorithm have recently dominated this application. In this study, the performance of iterative codes based on turbo equalizers with equivalent coding rates and similar code word lengths were analyzed. Underwater acoustic communication system experiments using these two coding techniques were conducted on Kyeong-chun Lake in Munkyeong City. The distance between the transmitter and receiver was 400 m, and the data transfer rate was 1 Kbps. The experimental results revealed that the performance of turbo codes is better for channeling than that of convolutional codes that use a BCJR decoding algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.3A
• /
• pp.217-225
• /
• 2005

This paper presents specialized DSP instructions and their architecture for the Viterbi algorithm used in various wireless communication standards. The proposed architecture can significantly reduce the Trace Back (TB) latency. The proposed instructions perform the Add Compare Select (ACS) and TB operations in parallel and the architecture has special hardware, called the Offset Calculation Unit (OCU), which automatically calculates data addresses for the trellis butterfly computations. Logic synthesis has been Performed using the Samsung SEC 0.18 μm standard cell library. OCU consists of 1,460 gates and the maximum delay of OCU is about 5.75 ns. The BER performance of the ACS-TB parallel method increases about 0.00022dB at 6dB Eb/No compared with the typical TB method, which is negligible. When the constraint length K is 5, the proposed DSP architecture can reduce the decoding cycles about 17% compared with the Carmel DSP and about 45% compared with 7MS320c15x.

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

In the application requiring the interoperability of different networks such as VoIP and wireless communication system, two speech codecs must work together with the structure of cascaded connection, tandem. Tandem has several problems such as long delay, high complexity and quality degradation due to twice complete encoding/decoding process. Transcoding is one of the best solutions to solve these problems. Transcoding algorithm is varied with the structure of source and target coder. In this paper, transcoding algorithm including the LSP conversion, the pitch estimation and new perceptual weighting filter for reducing complexity and improving qualify is proposed. These algorithms are applied to the pair of AMR md G.723.1. By employing the proposed algorithms in the transcoder, the complexity is reduced by about 20%-58% and quality is improved compared to tandem.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.44 no.6
• /
• pp.30-35
• /
• 2007

H.264/AVC provides better quality than other algorithms by using a deblocking filter to remove blocking distortion on block boundary of the decoded picture. However, this filtering process includes lots of memory accesses, which cause delay of overall decoding time. In this paper, we propose a data-reuse algorithm to speed up the process for the deblocking filter. To reuse the data, a new filtering order is suggested. By using this order, we reduce the memory access and accelerate the deblocking filter. The modeling of proposed algorithm is compiled under ARM ADS1.2 and simulated with Armulator. The results of the experiment compared with H.264/AVC standard are achieved on average 58.45% and 57.93% performance improvements at execution cycles and memory access cycles, respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.5C
• /
• pp.411-421
• /
• 2002

In this paper, we present a new survivor path memory management method and a dedicated hardware architecture for the design of high-speed Viterbi decoders in modern digital communication systems. In the proposed method, a novel use of k-starting node number deciding circuits enables to acheive the immediate traceback of the merged survivor path from which we can decode output bits, and results in smaller survivor path memory size and processing delay time than the previously known methods. Also, in the proposed method, the survivor path memory can be constructed with ease using a simple standard dual-ported memory since one read-pointer and one write-pointer, that are updated at the same rate, are required for managing the survivor path: the previously known algorithms require either complex k-ported memory structure or k-times faster read capability than write. With a moderate hardware cost for immediate traceback capability the proposed method is superior to the previously known methods for high-speed Viterbi decoding.

• Journal of Broadcast Engineering
• /
• v.16 no.3
• /
• pp.530-541
• /
• 2011

In this paper, we propose an effective network-adaptive ARQ based error control scheme to provide video streaming services through IP networks where packet error usually occurs. If time delay and feedback channel are allowed, client can request server to retransmit lost packets through IP networks. However, if retransmission is unconditionally requested without considering network condition and number of simultaneous feedback messages, retransmitted packets may not arrive in a timely manner so that decoding may not occur. In the proposed ARQ, a client conditionally requests retransmission based on assumed network condition, and it further determines valid retransmission time so that effective ARQ can be applied. In order to verify the performance of the proposed adaptive ARQ based error control, NIST-Net is used to emulate packet-loss network environment. It is shown by simulations that the proposed scheme provides noticeable error resilience with significantly reduced traffics required for ARQ.

• The Journal of the Acoustical Society of Korea
• /
• v.32 no.2
• /
• pp.124-130
• /
• 2013

The performance of underwater acoustic communication system is sensitive to the ISI(Inter-Symbol Interference) due to delay spread develop of multipath signal propagation. The equalizer is used to combat the ISI. In this paper, the performances of underwater acoustic communication with turbo equalizer were evaluated by real data collected in Korean littoral sea. As a result, when one iterative decoding using turbo equalizer is applied, the performance was improved 1.5 dB than the case of the non-iterative equalizer at BER $10^{-4}$. In the case of two or three iterations the performance was enhanced about 3.5 dB, but the performance wasn't improved any more in the case of more than three times.