• 한국통신학회논문지
• /
• 제38A권1호
• /
• pp.10-18
• /
• 2013

최근 고정된 연산량을 가지므로 하드웨어 구현이 용이한 고정연산량 (fixed-complexity) lattice reduction (fcLR) 기법이 제안되었다. 또한 한 개의 레이어에는 모든 성상점을 시도하여 높은 오류성능을 달성하는 QR-LRL (QR분해-least reliable layer) 신호검출기법이 제안되었다. 본 논문에서는 이 두 가지 기법을 결합하여 연산량은 고정되고 오류성능은 더욱 우수한 신호검출기법을 제안한다. QR-LRL에서와 같이 가장 신뢰도가 낮은 레이어 LRL을 제외한 후 LR을 수행하게 되면 LR의 연산복잡도가 크게 감소함을 보인다. 결과적으로 연산복잡도와 오류성능 관점에서 모두 제안된 방식이 기존 fcLR 기반 신호검출기법보다 우수한 성능을 달성한다. 모의실험을 통해 제안된 기법이 기존 기법에 비해 고정연산량 및 오류성능 관점에서 동시에 우수함을 보인다.

• 한국멀티미디어학회논문지
• /
• 제21권3호
• /
• pp.342-347
• /
• 2018

We proposed a fast detection of copy-move image forgery using four step search algorithm in the spatial domain. In the four-step search algorithm, the search area is 21 (-10 ~ +10), and the number of pixels to be scanned is 33. Our algorithm reduced computational complexity more than conventional copy move image forgery methods. The proposed method reduced 92.34 % of computational complexity compare to exhaustive search algorithm.

• Journal of Communications and Networks
• /
• 제11권1호
• /
• pp.20-25
• /
• 2009

The maximum likelihood detection with QR decomposition and M-algorithm (QRM-MLD) has been presented as a suboptimum multiple-input multiple-output (MIMO) detection scheme which can provide almost the same performance as the optimum maximum likelihood (ML) MIMO detection scheme but with the reduced complexity. However, due to the lack of parallelism and the regularity in the decoding structure, the conventional QRM-MLD which uses the tree-structure still has very high complexity for the very large scale integration (VLSI) implementation. In this paper, we modify the tree-structure of conventional QRM-MLD into trellis-structure in order to obtain high operational parallelism and regularity and then apply the Viterbi algorithm to the QRM-MLD to ease the burden of the VLSI implementation.We show from our selected numerical examples that, by using the QRM-MLD with our proposed trellis-structure, we can reduce the complexity significantly compared to the tree-structure based QRM-MLD while the performance degradation of our proposed scheme is negligible.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권5호
• /
• pp.2141-2155
• /
• 2020

In order to meet the requirements of background change, illumination variation, moving shadow interference and high accuracy in object detection of moving camera, and strive for real-time and high efficiency, this paper presents an object detection algorithm based on sparse approximation recursion and sparse coding migration in subspace. First, low-rank sparse decomposition is used to reduce the dimension of the data. Combining with dictionary sparse representation, the computational model is established by the recursive formula of sparse approximation with the video sequences taken as subspace sets. And the moving object is calculated by the background difference method, which effectively reduces the computational complexity and running time. According to the idea of sparse coding migration, the above operations are carried out in the down-sampling space to further reduce the requirements of computational complexity and memory storage, and this will be adapt to multi-scale target objects and overcome the impact of large anomaly areas. Finally, experiments are carried out on VDAO datasets containing 59 sets of videos. The experimental results show that the algorithm can detect moving object effectively in the moving camera with uniform speed, not only in terms of low computational complexity but also in terms of low storage requirements, so that our proposed algorithm is suitable for detection systems with high real-time requirements.

• 전자공학회논문지
• /
• 제50권8호
• /
• pp.61-66
• /
• 2013

본 논문에서는 채널부호화 다중 안테나 시스템에서 공간다중화 전송된 신호들을 효과적으로 복조하기 위한 저연산 연판정 복조 다중 안테나 반복검출 기법을 제시한다. 반복 검출기법의 경우 우수한 성능에도 불구하고 연산량의 복잡성으로 수신단에 높은 복잡도를 요청하게 된다. 이러한 복잡도 감소를 위해 차원감소 소프트 검출 기법 (DRSD)과 모든 순서 순차적 간섭 제거(AOSIC) 기법을 사용한다. 이 기법의 경우 기존 기법들에 비해 반복검출 기법의 연산량의 복잡성을 줄일 수 있으며 향상된 성능을 얻을 수 있다.

• 한국통신학회논문지
• /
• 제35권3A호
• /
• pp.231-237
• /
• 2010

MIMO(Multi-input Multi-output) 시스템은 안테나 개수에 비례하여 높은 데이터 전송량을 제공하지만 복호 과정에서 매우 높은 연산량을 필요로 한다. 높은 연산량을 극복하고 보다 정확한 신호추정을 위해 제안된 것이 SD(Sphere Decoding) 알고리듬이다. 본 논문에서는 기존의 SE SD 알고리듬에 MMSE(Minimum Mean Square Error)와 Euclid 거리 기준을 적용하여 연산량은 증가시키지 않으면서 검파 성능을 향상시키는 MIMO 검파 알고 리듬을 제안한다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2007년도 하계종합학술대회 논문집
• /
• pp.185-186
• /
• 2007

In this paper, We propose the selective detection scheme based on pulse repetition considering Bit Error Rate (BER) performance and complexity of noncoherent Ultra Wide Band (UWB) systems. To consider system complexity, the proposed scheme transmits the UWB signals by pulse repetition at the transmitter, like the conventional Pulse Repetition Coding (PRC). However, to effectively improve BER performance of the system the proposed scheme performs selective detection by estimating the Signal-to-Noise Ratio (SNR) of the received pulse-repeated signal at the receiver. Hence, the proposed scheme effectively improves BER performance of the noncoherent UWB systems without increase of the system complexity, as compared to the conventional PRC algorithm.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2005년도 춘계종합학술대회
• /
• pp.126-130
• /
• 2005

In this paper, a low-complexity maximum-likelihood (ML) decoder based on QR decomposition, called real-valued LCMLDec decoder or RVLCMLDec for short, is proposed for the Vertical Bell Labs Layered Space-Time (V-BLAST) architecture, a promising candidate for providing high data rates in future fixed wireless communication systems [1]. Computer simulations, in comparison with other detection techniques, show that the proposed decoder is capable of providingthe V-BLAST schemes with ML performance at low detection complexity.

• 한국통신학회논문지
• /
• 제32권2C호
• /
• pp.160-165
• /
• 2007

In this paper, we propose a novel signal detection method that achieves the maximum likelihood (ML) performance but requires much less computational complexity than the ML detection. When the well-known linear decoding method is used for space-time block coded (STBC) OFDM systems in fast-fading channels, co-channel interference (CCI) as well as inter-carrier interference (ICI) occurs. A maximum likelihood (ML) method can be employed to deal with the CCI; however, its computational complexity is very high. In this paper, we propose a signal detection method for orthogonal space-time coded OFDM systems that achieves the similar error performance as the ML method, but requires much less computational complexity.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권4호
• /
• pp.1504-1526
• /
• 2018

For uplink multi-user massive MIMO systems, conventional minimum mean square error (MMSE) linear detection method achieves near-optimal performance when the number of antennas at base station is much larger than that of the single-antenna users. However, MMSE detection involves complicated matrix inversion, thus making it cumbersome to be implemented cost-effectively and rapidly. In this paper, we first summarize in detail the state-of-the-art simplified MMSE detection algorithms that circumvent the complicated matrix inversion and hence reduce the computation complexity from ${\mathcal{O}}(K^3)$ to ${\mathcal{O}}(K^2)$ or ${\mathcal{O}}(NK)$ with some certain performance sacrifice. Meanwhile, we divide the simplified algorithms into two categories, namely the matrix inversion approximation and the classical iterative linear equation solving methods, and make comparisons between them in terms of detection performance and computation complexity. In order to further optimize the detection performance of the existing detection algorithms, we propose more proper solutions to set the initial values and relaxation parameters, and present a new way of reconstructing the exact effective noise variance to accelerate the convergence speed. Analysis and simulation results verify that with the help of proper initial values and parameters, the simplified matrix inversion based detection algorithms can achieve detection performance quite close to that of the ideal matrix inversion based MMSE algorithm with only a small number of series expansions or iterations.