• ETRI Journal
• /
• 제45권3호
• /
• pp.418-432
• /
• 2023

In this work, we proposed a low-complexity hybrid layered tabu-likelihood ascent search (LTLAS) algorithm for large multiple-input multiple-output (MIMO) system. The conventional layered tabu search (LTS) approach involves many partial reactive tabu searches (RTSs), and each RTS requires an initialization and searching phase. In the proposed algorithm, we restricted the upper limit of the number of RTS operations. Once RTS operations exceed the limit, RTS will be replaced by low-complexity likelihood ascent search (LAS) operations. The block-based detection approach is considered to maintain a higher signal-to-noise ratio (SNR) detection performance. An efficient precomputation technique is derived, which can suppress redundant computations. The simulation results show that the bit error rate (BER) performance of the proposed detection method is close to the conventional LTS method. The complexity analysis shows that the proposed method has significantly lower computational complexity than conventional methods. Also, the proposed method can reduce almost 50% of real operations to achieve a BER of 10^-3.

• 한국통신학회논문지
• /
• 제36권4C호
• /
• pp.217-225
• /
• 2011

본 논문에서는 영상의 지역 특성별로 보간 방법을 적응적으로 선택하여 적용하는 효과적인 디인터레이싱 알고리듬을 제안한다. 기존의 알고리듬들의 경우 각기 다른 방법으로 방향성을 구하기 때문에 영상의 지역 특성별로 성능이 다르게 나오는 경우가 있다. 또한, FDD(Fine Directional De-interlacing) 알고리듬의 경우 PSNR(Peak Signal-to-Noise Ratio)은 다른 알고리듬들에 비해 높게 나오지만 계산량이 많다는 단점이 있다. 이를 보안하기 위해 본 논문에서는 여러 영상들에서 계산량은 적으면서 화질 성능은 뛰어난 LA(Line Average), MELA(Modified Edge-based Line Average), LCID(Low-Complexity Interpolation Method for De-interlacing) 알고리듬들 중 지역복잡도 (DoLC, Degree of Local Complexity)별로 효과적인 알고리듬을 학습하여 이를 이용하여 보간을 수행하는 디인터레이싱 방법을 제안한다. 실험 결과 제안하는 방법은 좋은 성능에 비해 계산량이 적은 LCID 알고리듬과 비슷한 계산량을 보이면서 객관적 화질이 우수한 FDD, MELA 알고리듬보다 PSNR로 대표되는 객관적 화질과 주관적 화질 측면에서 우수한 결과를 나타내는 것을 알 수 있다.

• 한국산학기술학회논문지
• /
• 제20권12호
• /
• pp.1-7
• /
• 2019

본 논문에서는 기상 및 환경조건에 영향을 받아 열화되기 쉬운 실외영상의 시인성을 개선하고 다양한 기기에 적용하기 위하여 저 복잡도의 단일 영상 안개 제거방법을 제안한다. 기존 방법에서는 거친 형태의 전달량을 추정한 후 연산량 및 메모리 요구량이 큰 정련 과정을 포함하는 반면, 제안하는 전달량 추정 방법은 에지 근처에서 픽셀 단위 dark channel과 패치 단위 dark channel을 비교함으로써 에지를 보존하는 특성이 우수하고 정련 과정이 필요하지 않아 저복잡도 전달량 추정이 가능하다. 또한, 픽셀 단위 JBDC(Joint Bright and Dark Channel)를 이용하여 각 픽셀마다 안개값을 예측함으로써 정밀한 전달량 추정과 영상의 특성에 따라 적응적인 안개 제거가 가능하다. 다양한 안개 영상에 대해 수행한 실험 결과는 제안하는 방법이 기존의 방법에 비해 적은 연산량으로 수행됨과 동시에 우수한 안개 제거 성능을 보여 실시간성이 요구되는 기기를 포함한 다양한 분야에 적용될 수 있음을 확인할 수 있다.

• ETRI Journal
• /
• 제32권1호
• /
• pp.163-165
• /
• 2010

A trend in 3D mesh compression is codec design with low computational complexity which preserves the input vertex and face order. However, this added information increases the complexity. We present a fast 3D mesh compression method that compresses the redundant shared vertex information between neighboring faces using simple first-order differential coding followed by fast entropy coding with a fixed length prefix. Our algorithm is feasible for low complexity designs and maintains the order, which is now part of the MPEG-4 scalable complexity 3D mesh compression standard. The proposed algorithm is 30 times faster than MPEG-4 3D mesh coding extension.

• ETRI Journal
• /
• 제29권4호
• /
• pp.445-451
• /
• 2007

An adaptive modulation scheme is presented for multiuser orthogonal frequency-division multiplexing systems. The aim of the scheme is to minimize the total transmit power with a constraint on the transmission rate for users, assuming knowledge of the instantaneous channel gains for all users using a combined bit-loading and subcarrier allocation algorithm. The subcarrier allocation algorithm identifies the appropriate assignment of subcarriers to the users, while the bit-loading algorithm determines the number of bits given to each subcarrier. The proposed bit-loading algorithm is derived from the geometric progression of the additional transmission power required by the subcarriers and the arithmetic-geometric means inequality. This algorithm has a simple procedure and low computational complexity. A heuristic approach is also used for the subcarrier allocation algorithm, providing a trade-off between complexity and performance. Numerical results demonstrate that the proposed algorithms provide comparable performance with existing algorithms with low computational cost.

• 한국통신학회논문지
• /
• 제21권7호
• /
• pp.1654-1667
• /
• 1996

The conventional fractal image compression methods have high computational complexity at encoding reduce PSNR at low bit rate and havehighly visible blocking effects in a reconstructed image. In this paper we propose a fractal image compression method based on disctete wavelet transform domain, which takes the absolute value of discrete wavelet transform coefficient, and assembles the discrete wavelet tranform coefficients of different highpass subbands corresponding to the same spatial block and then applies "0" encoding according to the energy of each range blocks. The proposed method improved PSNR at low bit rate and reduced computational complexity at encoding distinctly. Also, this method can achieve a blockless reconstructed image and perform hierarchical decoding without recursive constractive transformation. Computer simulations with several test images show that the proposed method shows better performance than convnetional fractal coding methods for encoding still pictures. pictures.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권9호
• /
• pp.4502-4517
• /
• 2019

Tone Injection (TI) scheme significantly reduces the peak-to-average power ratio (PAPR) of Multicarrier Modulation (MCM). However, the computational complexity of the TI scheme rises exponentially with the extra freedom constellation number. Therefore, a novel immune evolutionary mechanism-based TI scheme is proposed in this paper to reduce the computational complexity. By restraining undesirable degeneracy during the processing, this IEM scheme can dramatically increase the population fitness. Monte Carlo results show that proposed IEM-based TI scheme can achieve a significant PAPR and BER improvement with a low complexity.

• Transactions on Electrical and Electronic Materials
• /
• 제18권6호
• /
• pp.320-322
• /
• 2017

In this paper, a high-performance, low-area gradient-magnitude calculator architecture is proposed, based on approximate image processing. To reduce the computational complexity of the gradient-magnitude calculation, vector properties, the symmetry axis, and common terms were applied in a hardware-resource-shared architec-ture. The proposed gradient-magnitude calculator was implemented using an Altera Cyclone IV FPGA (EP4CE115F29) and the Quartus II v.16 device software. It satisfied the output-data quality while reducing the logic elements by 23% and the embedded multipliers by 76%, compared with previous work.

• 대한전자공학회논문지TC
• /
• 제45권4호
• /
• pp.1-8
• /
• 2008

OFDM(orthogonal frequency division multiplexing) 시스템에서 무선 채널의 시변 특성으로 인해 인접캐리어 간의 간섭(ICI: intercarrier interference)이 발생하며 이로 인해 시스템 성능이 저하되게 된다. 이러한 현상은 도플러(doppler) 주파수가 커질수록 보다 크게 나타나게 된다. ICI의 영향을 완화하기 위하여 일반적인 ZF(zero-forcing) 선형 등화기를 사용할 수 있으나, 이 방식은 큰 행렬의 역행렬 계산이 요구되어 높은 복잡도를 가지게 된다. 본 논문에서는 OFDM 시스템에서 발생되는 ICI의 영향을 제거하기 위하여 적은 계산량을 가지는 ZF 등화 방식을 제안하고자 한다. 제안된 ZF 등화 방식은 역행렬 연산을 위한 수치적인 방법인 2차의 Neumann 급수와 특정한 부반송파에서 발생되는 ICI는 주로 인접 부반송파로부터 온다는 ICI의 특징을 이용한다. 또한, 적은 연산량으로 성능을 향상시키기 위하여 부분 ICI 제거 방법이 사용된다 복잡도 비교와 시뮬레이션 결과를 통해 제안된 ZF 등화 방식이 계산량을 크게 줄이면서도 일반적인 ZF 등화기법과 거의 동일한 성능을 보임을 확인한다.

• IEIE Transactions on Smart Processing and Computing
• /
• 제2권6호
• /
• pp.345-349
• /
• 2013

This paper proposes a simplified generalized residual prediction (GRP) that reduces the computational complexity of spatial scalability in scalable high efficiency video coding (SHVC). GRP is a coding tool to improve the inter prediction by adding a residual signal to the inter predictor. The residual signal was created by carrying out motion compensation (MC) of both the enhancement layer (EL) and up-sampled reference layer (RL) with the motion vector (MV) of the EL. In the MC process, interpolation of the EL and the up-sampled RL are required when the MV of the EL has sub-pel accuracy. Because the up-sampled RL has few high frequency components, interpolation of the up-sampled RL does not give significantly new information. Therefore, the proposed method reduces the computational complexity of the GRP by skipping the interpolation of the up-sampled RL. The experiment on SHVC software (SHM-2.0) showed that the proposed method reduces the decoding time by 10 % compared to conventional GRP. The BD-rate loss of the proposed method was as low as 1.0% on the top of SHM-2.0.