• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.39 no.4
• /
• pp.395-402
• /
• 2002

In the conventional public switched telephone network(PSTN), there are various types of modulation that can be used in ADSL to offer fast data communication, two of which are CAP(Carrierless Amplitude Phase) and DMT(Discrete MultiTone). As we consider the current situation, DMT is getting more predominant in the market than CAP. One of the reasons is that it gives high performance in spite of its high complexity Since DMT divides the full range of bandwidth into 256 sub-channels, it can be highly adaptive in the circumstances, where the problems of attenuation and noise caused by the propagation distance are very crucial. In this paper, a new bit loading algorithm for DMT modulation is proposed. The proposed algorithm can be efficiently implemented in a way that it requires less computation than the conventional modulation techniques. In contrast to the conventional algorithms which perform sorting processing, the proposed algorithm uses look-up tables to reduce the repetition of calculation. Consequently, it is shown that less processing time and lower complexity can be achieved.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.5 no.1
• /
• pp.23-30
• /
• 2010

The H.264/AVC is increasingly used in broadcast video applications such as Internet Protocol television (IPTV), digital multimedia broadcasting (DMB) because of high compression performance. But the H.264/AVC coded video can be delivered to the widespread end-user equipment for MPEG-2 after transcoding between this video standards. This paper suggests a new transcoding algorithm for H.264/AVC to MPEG-2 transcoder that uses motion vector clustering in order to reduce the complexity without loss of video quality. The proposed method is exploiting the motion information gathered during h.264 decoding stage. To reduce the search space for the MPEG-2 motion estimation, the predictive motion vector is selected with a least distortion of the candidated motion vectors. These candidate motion vectors are considering the correlation of direction and distance of motion vectors of variable blocks in H.264/AVC. And then the best predictive motion vector is refined with full-search in ${\pm}2$ pixel search area. Compared with a cascaded decoder-encoder, the proposed transcoder achieves computational complexity savings up to 64% with a similar PSNR at the constant bitrate(CBR).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.12C
• /
• pp.1231-1238
• /
• 2005

This paper presents a new fast encoding algorithm for image vector quantization that incorporates the partial distances of multiple features with a multidimensional look-up table (LUT). Although the methods which were proposed earlier use the multiple features, they handles the multiple features step by step in terms of searching order and calculating process. On the other hand, the proposed algorithm utilizes these features simultaneously with the LUT. This paper completely describes how to build the LUT with considering the boundary effect for feasible memory cost and how to terminate the current search by utilizing partial distances of the LUT Simulation results confirm the effectiveness of the proposed algorithm. When the codebook size is 256, the computational complexity of the proposed algorithm can be reduced by up to the $70\%$ of the operations required by the recently proposed alternatives such as the ordered Hadamard transform partial distance search (OHTPDS), the modified $L_2-norm$ pyramid ($M-L_2NP$), etc. With feasible preprocessing time and memory cost, the proposed algorithm reduces the computational complexity to below the $2.2\%$ of those required for the exhaustive full search (EFS) algorithm while preserving the same encoding quality as that of the EFS algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.3A
• /
• pp.188-195
• /
• 2002

The M-algorithm for decoding convolutional codes can significantly reduce the complexity of the Viterbi algorithm by tracking a fixed number of survivor paths in each level of the decoding trellis. It is an easily-implementable algorithm suited for real-time processing of high-speed data. The algorithm, however, generates a sequence of catastrophic errors when the correct path is not included in the set of survivor paths. In this paper, the performance of the M-algorithm obtained from using various decoding complexity levels, frame lengths, and code constraint lengths is presented. The performance gain is quantified when the algorithm is used in conjunction with codes of increased constraint length. In particular, it is demonstrated the gain from the increased code free distance overcompensates the loss from the correct path being excluded from the survivors, when the frame length is short to moderate. Using 64 survivor paths, the signal-to-noise ratio gain obtained by increasing the constraint length from K=7 to K=9, 11, 15 is respectively 0.6, 0.75, and 08dB, when the frame of length L=100 has the frame error rate of 0.01%.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.8
• /
• pp.1442-1449
• /
• 2007

Shadows are important elements for realistic rendering of the 3D scene. We cannot recognize the distance of objects in the 3D scene without shadows. Two methods, image-based medthods and object-based methods, are largely used for the rendering of shadows. Object based methods can generate accurate shadow boundaries. However, it cannot be used to generate the realtime shadows because the time complexity defends on the complexity of the 3D scene. Image based methods which are techniques to generate shadows are widely used because of fast calculation time. However, this algorithm has aliasing problems. PCF is a method to solve the aliasing problem. Using PCF technique, antialiased shadow boundaries can be generated. However, PCF with large filter size requires more time to calculate antialiased shadow boundaries. This paper proposes an improved PCF technique which generates antialiased shadow boundaries similar to that of PCF. Compared with PCF, this technique can generate antialiased shadows in less time.

• Mass Spectrometry Letters
• /
• v.12 no.4
• /
• pp.192-199
• /
• 2021

Alpine glaciers harbor a large quantity of bio-labile dissolved organic matter (DOM), which plays a pivotal role in global carbon cycling as glacial-fed streams are headwaters of numerous large rivers. To understand the complexity, origin, and fate of DOM in glaciers and downstream-linked streams and lakes, we elucidated the molecular composition of DOM in two different Tibetan Plateau glaciers, eight glacial-fed streams and five lakes, using an ultrahigh-resolution 15 Tesla Fourier transform ion cyclotron resonance (FT-ICR) mass spectrometer. The compositional changes of the DOM samples revealed that glacier DOM mostly exhibited sulfur-containing organic compounds (CHOS species). We also found that aliphatic formulae contributed more than 50% of the total abundance of assigned molecules in glacier samples, and those compounds were significantly related to CHOS species. The CHO proportions of glacial-fed streams and lakes samples increased with increasing distance from glacial terminals. The relative contribution of terrestrial-derived organics (i.e., lignins and tannins) declined while microbial-originated organics (aliphatics) increased with increasing elevation. This suggested the gradual input of allochthonous materials from non-glacial environment and the degradation of microbe-derived compounds along lower elevations. Alpine glaciers are retreating as a result of climate change and they nourished numerous streams, rivers, and downstream-linked lakes. Therefore, the interpretations of the detailed molecular changes in glacier ice, glacial-fed streams, and alpine lakes on the Tibetan Plateau could provide broad insights for understanding the biogeochemical cycling of glacial DOM and assessing how the nature of DOM impacts fluvial ecosystems.

• Journal of Advanced Navigation Technology
• /
• v.10 no.4
• /
• pp.371-376
• /
• 2006

The initial radius of sphere decoder has great effect on the bit error rate performance and computational complexity. Until now, it has been determined either by considering the statistical property of channel or by using of MMSE solution. The initial radius obtained by using statistical property of channel includes the lattice point corresponding to the transmit signal vector with very high probability. The method using MMSE solution first calculates out the MMSE solution of the received signal, then maps the hard decision of this solution into the received signal space, and finally the distance between the mapped point and the received signal is selected as the initial radius of the sphere decoding. In this paper, we derive a simple equation for initial radius selection which uses statistical property of channel and compare it with the method using MMSE solution. To compare two methods we define new metric 'Tightness'. Through the simulation, we observe that in low and moderate SNR region, the method using MMSE solution provides more complexity reduction for decoding while in high SNR region, the method using channel statistics is better.

• Journal of Broadcast Engineering
• /
• v.24 no.6
• /
• pp.948-955
• /
• 2019

As interests in 360-degree VR (Virtual Reality) video services enormously grow, compression and streaming technologies for VR video data have been rapidly developed. Quality Emphasized Region (QER) based streaming scheme has been developed as a kind of viewport-adaptive 360-degree video streaming technology for maintaining immersive experience and reducing bandwidth waste. For selecting a QER corresponding to the user's gaze coordinate, QER-based streaming scheme requires the calculation of Quality Emphasis Center (QEC) distance and signaling message delivery for requesting QER switching. QEC distance calculations require high computational complexity because of repeated calculations as many times as the number of QERs. Furthermore, the signaling message interval results in a trade-off relationship between efficient bandwidth usage and flexible QER switching. In this paper, we propose an improved QER selection algorithm based on MMT protocol to solve this problem. The proposed algorithm could achieve computational complexity reduction by using preprocessed QER_ID_MAP. Also, flexible QER switching could be achieved, as well as efficient bandwidth utilization by an adaptive adjustment of the signaling interval.

• Journal of Communications and Networks
• /
• v.10 no.1
• /
• pp.5-9
• /
• 2008

Researchers have investigated many upper bound techniques applicable to error probabilities on the maximum likelihood (ML) decoding performance of turbo-like codes and low density parity check (LDPC) codes in recent years for a long codeword block size. This is because it is trivial for a short codeword block size. Previous research efforts, such as the simple bound technique [20] recently proposed, developed upper bounds for LDPC codes and turbo-like codes using ensemble codes or the uniformly interleaved assumption. This assumption bounds the performance averaged over all ensemble codes or all interleavers. Another previous research effort [21] obtained the upper bound of turbo-like code with a particular interleaver using a truncated union bound which requires information of the minimum Hamming distance and the number of codewords with the minimum Hamming distance. However, it gives the reliable bound only in the region of the error floor where the minimum Hamming distance is dominant, i.e., in the region of high signal-to-noise ratios. Therefore, currently an upper bound on ML decoding performance for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix cannot be calculated because of heavy complexity so that only average bounds for ensemble codes can be obtained using a uniform interleaver assumption. In this paper, we propose a new bound technique on ML decoding performance for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix using ML estimated weight distributions and we also show that the practical iterative decoding performance is approximately suboptimal in ML sense because the simulation performance of iterative decoding is worse than the proposed upper bound and no wonder, even worse than ML decoding performance. In order to show this point, we compare the simulation results with the proposed upper bound and previous bounds. The proposed bound technique is based on the simple bound with an approximate weight distribution including several exact smallest distance terms, not with the ensemble distribution or the uniform interleaver assumption. This technique also shows a tighter upper bound than any other previous bound techniques for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.6C
• /
• pp.642-648
• /
• 2009

In this paper, we use SA (Seysen's Algorithm) instead of LLL (Lenstra-Lenstra-Lovasz) to perform LRA (Lattice Reduction-Aided) detection. By using SA, the complexity of lattice reduction is reduced and the detection performance is improved Although the performance is improved using SA, there still exists a gap in the performance between SA-LRA and ML detection. To reduce the performance difference, we apply list of candidates scheme to SA-LRA. The list of candidates scheme finds a list of candidates. Then, the candidate with the smallest squared Euclidean distance is considered as the estimate of the transmitted signal. Simulation results show that the SA-LRA detection learn to quasi-ML performance. Moreover, the efficiency of the SA is shown to highly improve the channel matrix conditionality.