• 한국전자통신학회논문지
• /
• 제17권6호
• /
• pp.1055-1062
• /
• 2022

매시브 배열 안테나를 이용한 매시브 MIMO(: Multi Input Multi Output) 기술을 이용하기 위해서는 신호의 도래각(Angle of Arrival : AOA) 파악이 필수적으로 요구된다. 매시브 배열 안테나를 하면 기존 AOA 추정 알고리즘은 뛰어난 추정 성능을 갖지만, 안테나 요소 수에 비례하여 계산복잡도가 증가하는 단점이 있다. 이러한 문제를 해결하기 위해 캐스케이드 AOA 추정 알고리즘이 제안되었으며 다수의 논문을 통해 단일 형상의 (비)매시브 배열 안테나에 대한 성능이 입증되었다. 하지만 단일 및 이중 림 어레이 안테나가 적용된 캐스케이드 AOA 추정 알고리즘의 계산복잡도 비교는 이루어지지 않았다. 본 논문에서는 단일 및 이중 림 어레이를 캐스케이드 AOA 추정 알고리즘에 적용된 경우 AOA 추정을 위한 계산복잡도를 비교 분석한다.

• 한국통신학회논문지
• /
• 제34권8A호
• /
• pp.583-591
• /
• 2009

높은 PAPR을 갖는 직교 주파수 분할 다중 접속 신호는 비선형 왜곡을 발생시키거나, 송신기의 전력 증폭기의 효율을 나쁘게 한다. 그래서 비선형 왜곡을 줄이기 위한 상호 변조 왜곡 저감 기법이 제안되었다. IMD 저감 기법은 비선형 왜곡에 대하여 PAPR 저감 기법보다 비트 오차율 작게 한다. 하지만 IMD 저감 기법의 결정 기준은 주파수 영역에서 이루어지기 때문에 송신기에 FFT가 추가되어 시스템 복잡도가 증가하고, IMD 연산의 복잡한 계산 과정과, 이에 따른 처리시간이 증가하는 문제가 있다. 그러므로 본 논문에서는 이러한 기존의 IMD 저감 기법의 복잡도와 계산량 저감하기 위한 새로운 방식의 IMD 저감 방식을 제안한다. 또한 본 논문에서는 제안된 방식을 PTS 방식의 OFDM 통신 시스템에 적용하여 기존의 기법과 복잡도와 계산량을 비교한다. 제안된 기법은 PAPR처럼 시간영역에서 IMD의 전력량을 계산하므로 송신기에서 시스템의 복잡도와 계산량을 크게 줄일 수 있다. 또한 새로운 기법은 기존 방식과 BER 성능 면에서 차이를 보이지 않는다.

• 한국통신학회논문지
• /
• 제31권4C호
• /
• pp.303-309
• /
• 2006

By combining the space-time diversity technique and iterative turbo codes, space-time turbo codes(STTCS) are able to provide powerful error correction capability. However, the multi-path transmission and iterative decoding structure of STTCS make the decoder very complex. In this paper, we propose a low complexity decoder, which can be used to decode STTCS as well as general iterative codes such as turbo codes. The efficient implementation of the backward recursion and the log-likelihood ratio(LLR) update in the proposed algorithm improves the computational efficiency. In addition, if we approximate the calculation of the joint LLR by using the approximate ratio(AR) algorithm, the computational complexity can be reduced even further. A complexity analysis and computer simulations over the Rayleigh fading channel show that the proposed algorithm necessitates less than 40% of the additions required by the conventional Max-Log-MAP algorithm, while providing the same overall performance.

• ETRI Journal
• /
• 제25권5호
• /
• pp.345-355
• /
• 2003

In this paper, we propose a method for designing a class of M-channel, causal, stable, perfect reconstruction, infinite impulse response (IIR), and parallel uniform discrete Fourier transform (DFT) filter banks. It is based on a previously proposed structure by Martinez et al. [1] for IIR digital filter design for sampling rate reduction. The proposed filter bank has a modular structure and is therefore very well suited for VLSI implementation. Moreover, the current structure is more efficient in terms of computational complexity than the most general IIR DFT filter bank, and this results in a reduced computational complexity by more than 50% in both the critically sampled and oversampled cases. In the polyphase oversampled DFT filter bank case, we get flexible stop-band attenuation, which is also taken care of in the proposed algorithm.

• 한국통신학회논문지
• /
• 제21권5호
• /
• pp.1109-1122
• /
• 1996

Generally, moving images contain the various components in motions, which reange from a static object and background to a fast moving object. To extract the accurate motion parameters, we must consider the various motions. That requires a wide search egion in motion estimation. The wide search, however, causes a high computational complexity. If we have a few knowledge about the motion direction and magnitude before motion estimation, we can determine the search location and search window size using the already-known information about the motion. In this paper, we present a local adaptive motion estimation approach that predicts a block motion based on spatio-temporal neighborhood blocks and adaptively defines the search location and search window size. This paper presents a technique for reducing computational complexity, while having high accuracy in motion estimation. The proposed algorithm is introduced the forward and backward projection techniques. The search windeo size for a block is adaptively determined by previous motion vectors and prediction errors. Simulations show significant improvements in the qualities of the motion compensated images and in the reduction of the computational complexity.

• 전자공학회논문지
• /
• 제51권3호
• /
• pp.139-143
• /
• 2014

This paper proposes a simplified DC calculation method for simplified depth coding (SDC) mode of 3D High Efficiency Video Coding (3D-HEVC) to reduce the computational complexity. For the computational complexity reduction, the current reference software of 3D-HEVC employs reference samples sub-sampling method. However, accumulation, branch, and division operations are still utilized and these operations increase computational complexity. The proposed method calculates DC value without those operations. The experimental results show that the proposed method achieves 0.1% coding gain for synthesized views in common test condition (CTC) with the significantly reduced number of computing operations.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2007년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.20-22
• /
• 2007

The H.264/AVC standard developed by the joint Video Team (JVT) provides better coding efficiency than previous standards. The new emerging H.264/AVC employs variable block size motion estimation using multiple reference frame with 1/4-pel MV(Motion Vector) accuracy. These techniques are a important feature to accomplish higher coding efficiency. However, these techniques are increased overall computational complexity. To overcome this problem, this paper proposes advanced fast mode decision suited for variable block size by classifying inter mode based on Rate Distortion Optimization(RDO) technique. Proposed algorithm is going to use to implement H/W structure for fast mode decision. The experimental results shows that the proposed algorithm provides significant reduction computational complexity without any noticeable coding loss and additional computation. Entire computational complexity is decreased about 30%.

• 한국멀티미디어학회논문지
• /
• 제21권1호
• /
• pp.18-25
• /
• 2018

In High Efficiency Video Coding (HEVC), integer motion estimation (IME) requires a large amount of computational complexity because HEVC adopts the high flexible and hierarchical coding structures. In order to reduce the computational complexity of IME, this paper proposes the search range reduction algorithm, which takes advantage of motion vectors similarity between different layers. It needs only a few modification for HEVC reference software. Based on the experimental results, the proposed algorithm reduces the processing time of IME by 28.1% on average, whereas its the $Bj{\emptyset}ntegaard$ delta bitrate (BD-BR) increase is 0.15% which is negligible.

• 디지털산업정보학회논문지
• /
• 제4권2호
• /
• pp.49-55
• /
• 2008

Combining OFDMA with MIMO is the key technology for the 4G mobile communication. OFDMA can relieve inherent difficulties of high-speed transmission. MIMO technology can be largely categorized into two techniques: one is STC for diversity gain and the other is SM for high frequency efficiency. In this paper, we depict various MIMO techniques of two transmit antenna and compare the computational complexity of decoding process for the techniques. Then, we analysis the performance of the techniques in the WiBro downlink environment based on OFDMA. We perfer ML algorithm which is the optimum performance and ZF algorithm of least computational complexity for SM detection.

• 디지털산업정보학회논문지
• /
• 제9권1호
• /
• pp.95-102
• /
• 2013

This paper covers nulling algorithm. In this algorithm, we assume that nulling points are already known. In general, nulling algorithm using matrix equation was utilized. But, this algorithm is pointed out that computational complexity is disadvantage. So, we choose gradient method to reduce the computational complexity. In order to further reduce the computational complexity, we propose approximate gradient method using characteristic of trigonometric functions. The proposed method has same performance compared with conventional method while having half the amount of computation when the number of antenna and nulling point are 20 and 1, respectively. In addition, we could virtually eliminate the trigonometric functions arithmetic. Trigonometric functions arithmetic cause a big problem in actual implementation like FPGA processor(Field Programmable gate array). By utilizing the above algorithm in a multi-cell environment, beamforming gain can be obtained and interference can be reduced at same time. By the above results, the algorithm can show excellent performance in the cell boundary.