• 제목/요약/키워드: Low complexity

검색결과 1,860건 처리시간 0.03초

공간 웨이블릿 변환의 복잡도를 줄인 스케일러블 비디오 부호화에 관한 연구 (Scalable Video Coding with Low Complex Wavelet Transform)

  • 박성호;정세윤;김원하
    • 전자공학회논문지CI
    • /
    • 제42권3호
    • /
    • pp.53-62
    • /
    • 2005
  • 인터 프레임 웨이블릿 부호화 기법의 복호화 과정에서 많은 연산량을 차지하는 모듈 중의 하나는 웨이블릿 변환이다. 복호기는 PDA, PC, 휴대폰등과 같이 다양한 단말기 상에서 동작 할 수 있어야 하기 때문에 복호기의 복잡도는 각 프로세서의 계산 능력에 맞게 설계되어야 한다. 따라서 스케일러블 부호화를 위한 코덱 역시 낮은 복잡도로 설계되어야 한다. 본 논문에서는 부호화 성능을 열화시키지 않으면서 공간 웨이블릿 변환의 복잡도를 조절하면서 줄이는 기법을 제안한다. 또한 이 기법은 천천히 변화하는 영상 시퀀스에 대해서는 웨이블릿 변환 시 발생하는 잔상 현상도 줄일 수 있다.

Low-area Bit-parallel Systolic Array for Multiplication and Square over Finite Fields

  • Kim, Keewon
    • 한국컴퓨터정보학회논문지
    • /
    • 제25권2호
    • /
    • pp.41-48
    • /
    • 2020
  • 본 논문은 유한체상의 곱셈과 제곱을 동시에 실행 가능한 알고리즘에서 공통적인 연산 부분을 도출하고, 순차적인 처리를 통해서 하드웨어를 감소시키고 공간면에서 효율적인 비트-병렬 시스톨릭 어레이를 제안한다. 제안한 시스톨릭 어레이는 기존의 어레이에 비해 적은 공간 및 공간-시간 복잡도(area-time complexity)를 가진다. 기존의 구조들과 비교하면, 제안한 시스톨릭 어레이는 공간 복잡도면에서 Choi-Lee, Kim-Kim의 시스톨릭 어레이의 약 48%, 44% 감소되었으며, 공간-시간 복잡도면에서 약 74%, 44% 가량 감소되었다. 따라서 제안한 시스톨릭 어레이는 VLSI 구현에 적합하며 사물인터넷과 같이 하드웨어 제약이 있는 환경에서 기초적인 구성 요소로 적용할 수 있다.

Low-Complexity MIMO Detection Algorithm with Adaptive Interference Mitigation in DL MU-MIMO Systems with Quantization Error

  • Park, Jangyong;Kim, Minjoon;Kim, Hyunsub;Jung, Yunho;Kim, Jaeseok
    • Journal of Communications and Networks
    • /
    • 제18권2호
    • /
    • pp.210-217
    • /
    • 2016
  • In this paper, we propose a low complexity multiple-input multiple-output (MIMO) detection algorithm with adaptive interference mitigation in downlink multiuser MIMO (DL MU-MIMO) systems with quantization error of the channel state information (CSI) feedback. In DL MU-MIMO systems using the imperfect precoding matrix caused by quantization error of the CSI feedback, the station receives the desired signal as well as the residual interference signal. Therefore, a complexMIMO detection algorithm with interference mitigation is required for mitigating the residual interference. To reduce the computational complexity, we propose a MIMO detection algorithm with adaptive interference mitigation. The proposed algorithm adaptively mitigates the residual interference by using the maximum likelihood detection (MLD) error criterion (MEC). We derive a theoretical MEC by using the MLD error condition and a practical MEC by approximating the theoretical MEC. In conclusion, the proposed algorithm adaptively performs interference mitigation when satisfying the practical MEC. Simulation results show that the proposed algorithm reduces the computational complexity and has the same performance, compared to the generalized sphere decoder, which always performs interference mitigation.

A low-complexity PAPR reduction SLM scheme for STBC MIMO-OFDM systems based on constellation extension

  • Li, Guang;Li, Tianyun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권6호
    • /
    • pp.2908-2924
    • /
    • 2019
  • Multiple input multiple output orthogonal frequency division multiplexing (MIMO-OFDM) is widely applied in wireless communication by virtue of its excellent properties in data transmission rate and transmission accuracy. However, as a major drawback of MIMO-OFDM systems, the high peak-to-average power ratio (PAPR) complicates the design of the power amplifier at the receiver end. Some available PAPR reduction methods such as selective mapping (SLM) suffer from high computational complexity. In this paper, a low-complexity SLM method based on active constellation extension (ACE) and joint space-time selective mapping (AST-SLM) for reducing PAPR in Alamouti STBC MIMO-OFDM systems is proposed. In SLM scheme, two IFFT operations are required for obtaining each transmission sequence pair, and the selected phase vector is transmitted as side information(SI). However, in the proposed AST-SLM method, only a few IFFT operations are required for generating all the transmission sequence pairs. The complexity of AST-SLM is at least 86% less than SLM. In addition, the SI needed in AST-SLM is at least 92.1% less than SLM by using the presented blind detection scheme to estimate SI. We show, analytically and with simulations, that AST-SLM can achieve significant performance of PAPR reduction and close performance of bit error rate (BER) compared to SLM scheme.

$GF(2^m)$ 상의 저복잡도 고속-직렬 곱셈기 구조 (Low Complexity Architecture for Fast-Serial Multiplier in $GF(2^m)$)

  • 조용석
    • 정보보호학회논문지
    • /
    • 제17권4호
    • /
    • pp.97-102
    • /
    • 2007
  • 본 논문에서는 $GF(2^m)$ 상의 새로운 저복잡도 고속-직렬 곱셈기 구조를 제안하였다. 고속-직렬 곱셈기는 유한체 $GF(2^m)$의 표준기저 상에서 동작하며, 직렬 곱셈기 보다는 짧은 지연시간에 결과를 얻을 수 있고, 병렬 곱셈기 보다는 적은 하드웨어로 구현할 수 있다. 이 고속-직렬 곱셈기는 회로의 복잡도와 지연시간 사이에 적절한 절충을 꾀할 수 있는 장점을 가지고 있다. 그러나 기존의 고속-직렬 곱셈기는 t배의 속도를 향상시키기 위하여 (t-1)m개의 레지스터가 더 사용되었다. 본 논문에서는 레지스터 수를 증가시키지 않는 새로운 고속-직렬 곱셈기를 설계하였다.

Low Complexity Hybrid Precoding in Millimeter Wave Massive MIMO Systems

  • Cheng, Tongtong;He, Yigang;Wu, Yuting;Ning, Shuguang;Sui, Yongbo;Huang, Yuan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제16권4호
    • /
    • pp.1330-1350
    • /
    • 2022
  • As a preprocessing operation of transmitter antennas, the hybrid precoding is restricted by the limited computing resources of the transmitter. Therefore, this paper proposes a novel hybrid precoding that guarantees the communication efficiency with low complexity and a fast computational speed. First, the analog and digital precoding matrix is derived from the maximum eigenvectors of the channel matrix in the sub-connected architecture to maximize the communication rate. Second, the extended power iteration (EPI) is utilized to obtain the maximum eigenvalues and their eigenvectors of the channel matrix, which reduces the computational complexity caused by the singular value decomposition (SVD). Third, the Aitken acceleration method is utilized to further improve the convergence rate of the EPI algorithm. Finally, the hybrid precoding based on the EPI method and the Aitken acceleration algorithm is evaluated in millimeter-wave (mmWave) massive multiple-input and multiple-output (MIMO) systems. The experimental results show that the proposed method can reduce the computational complexity with the high performance in mmWave massive MIMO systems. The method has the wide application prospect in future wireless communication systems.

Modulation Recognition of MIMO Systems Based on Dimensional Interactive Lightweight Network

  • Aer, Sileng;Zhang, Xiaolin;Wang, Zhenduo;Wang, Kailin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제16권10호
    • /
    • pp.3458-3478
    • /
    • 2022
  • Automatic modulation recognition is the core algorithm in the field of modulation classification in communication systems. Our investigations show that deep learning (DL) based modulation recognition techniques have achieved effective progress for multiple-input multiple-output (MIMO) systems. However, network complexity is always an additional burden for high-accuracy classifications, which makes it impractical. Therefore, in this paper, we propose a low-complexity dimensional interactive lightweight network (DilNet) for MIMO systems. Specifically, the signals received by different antennas are cooperatively input into the network, and the network calculation amount is reduced through the depth-wise separable convolution. A two-dimensional interactive attention (TDIA) module is designed to extract interactive information of different dimensions, and improve the effectiveness of the cooperation features. In addition, the TDIA module ensures low complexity through compressing the convolution dimension, and the computational burden after inserting TDIA is also acceptable. Finally, the network is trained with a penalized statistical entropy loss function. Simulation results show that compared to existing modulation recognition methods, the proposed DilNet dramatically reduces the model complexity. The dimensional interactive lightweight network trained by penalized statistical entropy also performs better for recognition accuracy in MIMO systems.

OFDM 시스템을 위한 복잡도가 감소된 ZF 등화기법 (A low complexity ZF Equalization for OFDM Systems over Time-varying Channels)

  • 박지현;황승훈;황금찬
    • 대한전자공학회논문지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 등화기법과 거의 동일한 성능을 보임을 확인한다.

Advanced Real-Time Rate Control for Low Bit Rate Video Communication

  • 김윤
    • 한국컴퓨터산업학회논문지
    • /
    • 제7권5호
    • /
    • pp.513-520
    • /
    • 2006
  • In this paper, we propose a novel real-time frame-layer rate control algorithm using sliding window method for low bit rate video coding. The proposed rate control method performs bit allocation at the frame level to minimize the average distortion over an entire sequence as well as variations in distortion between frames. A new frame-layer rate-distortion model is derived, and a non-iterative optimization method is used for low computational complexity. In order to reduce the quality fluctuation, we use a sliding window scheme which does not require the pre-analysis process. Therefore, the proposed algorithm does not produce time delay from encoding, and is suitable for real-time low-complexity video encoder. Experimental results indicate that the proposed control method provides better visual and PSNR performance than the existing TMN8 rate control method.

  • PDF

Low-Complexity Multi-size Cyclic-Shifter for QC-LDPC Codes

  • Kang, Hyeong-Ju;Yang, Byung-Do
    • ETRI Journal
    • /
    • 제39권3호
    • /
    • pp.319-325
    • /
    • 2017
  • The decoding process of a quasi-cyclic low-density parity check code requires a unique type of rotator. These rotators, called multi-size cyclic-shifters (MSCSs), rotate input data with various sizes, where the size is the amount of data to be rotated. This paper proposes a low-complexity MSCS structure for the case when the sizes have a nontrivial common divisor. By combining the strong points of two previous structures, the proposed structure achieves the smallest area. The experimental results show that the area reduction was more than 14.7% when the proposed structure was applied to IEEE 802.16e as an example.