• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권8호
• /
• pp.3772-3790
• /
• 2016

It is well known that the constant modulus algorithm (CMA) presents a large steady-state mean-square error (MSE) for high-order quadrature amplitude modulation (QAM) signals. In this paper, we propose a low-complexity hybrid adaptive blind equalization algorithm, which augments the CMA error function with a novel constellation matched error (CME) term. The most attractive advantage of the proposed algorithm is that it is computationally simpler than concurrent CMA and soft decision-directed (SDD) scheme (CMA+SDD), and modified CMA (MCMA), while the approximation of steady-state MSE of the proposed algorithm is same with CMA+SDD, and lower than MCMA. Extensive simulations demonstrate the performance of the proposed algorithm.

• 전자공학회논문지S
• /
• 제34S권8호
• /
• pp.74-83
• /
• 1997

In this paper, we propose a new fractal image decoding algorithm with fast convergence speed by using the data dependence and the improved initial image estimation. Conventional method for fractal image decoding requires high-degrdd computational complexity in decoding process, because of iterated contractive transformations applied to whole range blocks. On proposed method, Range of reconstruction imagte is divided into referenced range and data dependence region. And computational complexity is reduced by application of iterated contractive transformations for the referenced range only. Data dependence region can be decoded by one transformations when the referenced range is converged. In addition, more exact initial image is estimated by using bound () function in case of all, and an initial image more nearer to a fixed point is estimated by using range block division estimation. Consequently, the convergence speed of reconstruction iamge is improved with 40% reduction of computational complexity.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2006년도 하계종합학술대회
• /
• pp.291-292
• /
• 2006

This paper presents rate-distortion optimization that is considered sequence statistics(complexity) to choose the best macroblock mode decision in H.264. In previous work, Lagrange multiplier is derived by the function of constant value 0.85 and QP so that is not the proper Lagrange multilplier for any image sequence. The proposed algorithm solves the problem by changing constant value 0.85 into adaptive value which is influenced by image complexity, and by reducing the encoder complexity to estimate the image statistics with the multiplication of transformed, quantized rate and distortion. Proposed algorithm is achieved the bit-rate saving up to 5% better than previous method.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제4권3호
• /
• pp.283-287
• /
• 2004

In this paper, a method of designing the efficient batch blind equalization with low complexity using a micro genetic algorithm (GA), is presented. In general, the blind equalization techniques that are focused on the complexity reduction might be carried out with minor effect on the performance. Among the advanced various subjects in the field of GAs, a micro genetic algorithm is employed to identity the unknown channel impulse response in order to reduce the search space effectively. A new cost function with respect to the constant modulus criterion is suggested considering its relation to the Wiener criterion. We provide simulation results to show the superiority of the proposed techniques compared to other existing techniques.

• International Journal of Computer Science & Network Security
• /
• 제24권9호
• /
• pp.21-29
• /
• 2024

Precoding of the orthogonal frequency division multiplexing (OFDM) with Walsh Hadamard transform (WHT) is known in the literature. Instead of performing WHT precoding and inverse discrete Fourier transform separately, a product of two matrix can yield a new matrix that can be applied with lower complexity. This resultant transform, T-transform, results in T-OFDM. This paper extends the limited existing work on T-OFDM significantly by presenting detailed account of its computational complexity, a lower complexity receiver design, an expression for PAPR and its cumulative distribution function (cdf), sensitivity of T-OFDM to timing synchronization errors, and novel analytical expressions signal to noise ratio (SNR) for multiple equalization techniques. Simulation results are presented to show significant improvements in PAPR performance, as well improvement in bit error rate (BER) in Rayleigh fading channel. This paper is Part II of a three-paper series on alternative transforms and many of the concepts and result refer to and stem from results in generalized multicarrier communication (GMC) system presented in Part I of this series.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권1호
• /
• pp.269-286
• /
• 2018

Signal detection in symmetric alpha-stable ($S{\alpha}S$) distributed noise is a challenging problem. This paper proposes a detector based on a decreasing exponential function (DEF). The DEF detector can effectively suppress the impulsive noise and achieve good performance in the presence of $S{\alpha}S$ noise. The analytical expressions of the detection and false alarm probabilities of the DEF detector are derived, and the parameter optimization for the detector is discussed. A performance analysis shows that the DEF detector has much lower computational complexity than the Gaussian kernelized energy detector (GKED), and it performs better than the latter in $S{\alpha}S$ noise with small characteristic exponent values. In addition, the DEF detector outperforms the fractional lower order moment (FLOM)-based detector in $S{\alpha}S$ noise for most characteristic exponent values with the same order of magnitude of computational complexity.

• Journal of the Korean Data and Information Science Society
• /
• 제28권6호
• /
• pp.1217-1227
• /
• 2017

딥러닝은 영상 인식, 음성 인식 등 기존의 머신 러닝 기법들로 해결이 어려웠던 분야에서 매우 우수한 성능을 보였고, 그로 인해 딥러닝의 폭발적인 연구의 증가가 있었다. 좋은 성능을 보이는 모형 및 모수 추정 방법에 대한 연구들이 주를 이루고 있는 현 흐름 속에서 딥러닝의 이론적인 연구 또한 조심스럽게 진행되고 있다. 본 논문에서는 딥러닝의 성공을 딥러닝 함수가 복잡한 함수를 효율적으로 잘 표현할 수 있음에 해답을 찾고, 이에 관련된 이론적인 연구들을 조사하여 분석하고자 한다.

• 한국멀티미디어학회논문지
• /
• 제10권7호
• /
• pp.838-845
• /
• 2007

본 논문에서는 디지털 영상을 확대하거나 축소하기 위한 수정된 3차 회선(Cubic Convolution) 스케일러를 제안하였다. 제안된 기법은 기존의 3차 회선 기법보다 적은 연산량을 가진다. 연산량을 감소시키기 위해 인접 화소의 차이값을 이용한 보간 기법을 선택하였고, 기존 3차 회선 기법의 3차 함수를 선형 함수로 변경하였다. 제안된 기법의 가중치를 계산하기 위해 덧셈기와 베럴 쉬프트(Barrel Shift)를 사용하였다. 제안된 기법은 기존의 기법과 연산량 그리고 화질에 대하여 비교하였다. 제안된 기법은 HDL로 설계 및 검증을 하였고, Xilinx Virtex FPGA을 사용하여 합성하였다.

• 한국정보처리학회논문지
• /
• 제6권1호
• /
• pp.90-95
• /
• 1999

소프트웨어 시스템이 양도된 이후에 시스템의 크기가 성장하는 과정을 나타내는 수학적 모델인 소프트웨어 성장 모델은 시스템의 크기와 계획된 크기를 달성하기 위해 요구되는 노력을 예측하는데 사용될 수 있다. 본 논문은 먼저 시스템의 크기 변화량이 추가되는 노력에 비례하고 시스템의 복잡도에 반비례한다는 가정하에서 소프트웨어 성장 모델을 유도한다. 이 모델에서는 시스템의 복잡도가 중요한 역할을 하는데, 본 논문에서는 시스템 크기의 멱함수 형태인 복잡도를 제안하고 실제 자료에 적용하여, 그 유용성을 보인다. 멱함수 형태의 시스템 복잡도는 추가로 복잡도 비교할 수 있게 하는 측도를 제공하는데, 이 측도는 시스템 크기에 무관하므로 크기가 다른 소프트웨어 시스템의 복잡도를 비교하는데 유용하게 사용될 수 있다.

• 한국농촌건축학회논문집
• /
• 제10권3호
• /
• pp.35-42
• /
• 2008

The purpose of this study is to suggest the possibility of complexity use these facilities for elderly welfare facility or public health facility and community center in rural. For this purpose this article researched into elderly welfare facilities, public health facilities and social welfare centers. And we studied of village community center, life pattern in old people in rural. With a rapidly increase in population of older people in rural, there is a great demand for the construction of complexes facilities. Particularly, there was highly demand for the public health facilities and the welfare programme of physiotherapy facilities on village community center in rural. However, there is not a intersection of space composition and specification function between elderly welfare facilities and public healthcare facilities and community welfare centers in this time. Accordingly, in the future plan for community center in rural, it is necessary to consider integration with public health facility. And it is necessary to compose the community center in consideration of the spatial organization of complexity as a possibility of community welfare activities.