• 제목/요약/키워드: low-complexity design

검색결과 347건 처리시간 0.021초

VLSI 지향적인 APP용 2-D SYSTOLIC ARRAY PROCESSOR 설계에 관한 연구 (A Study on VLSI-Oriented 2-D Systolic Array Processor Design for APP (Algebraic Path Problem))

  • 이현수;방정희
    • 전자공학회논문지B
    • /
    • 제30B권7호
    • /
    • pp.1-13
    • /
    • 1993
  • In this paper, the problems of the conventional special-purpose array processor such as the deficiency of flexibility have been investigated. Then, a new modified methodology has been suggested and applied to obtain the common solution of the three typical App algorithms like SP(Shortest Path), TC(Transitive Closure), and MST(Minimun Spanning Tree) among the various APP algorithms using the similar method to obtain the solution. In the newly proposed APP parallel algorithm, real-time Processing is possible, without the structure enhancement and the functional restriction. In addition, we design 2-demensional bit-parallel low-triangular systolic array processor and the 1-PE in detail. For its evaluation, we consider its computational complexity according to bit-processing method and describe relationship of total chip size and execution time. Therefore, the proposed processor obtains, on which a large data inputs in real-time, 3n-4 execution time which is optimal o(n) time complexity, o(n$^{2}$) space complexity which is the number of total gate and pipeline period rate is one.

  • PDF

m-비트 병렬 BCH 인코더의 새로운 설계 방법 (A new design method of m-bit parallel BCH encoder)

  • 이준;우중재
    • 융합신호처리학회논문지
    • /
    • 제11권3호
    • /
    • pp.244-249
    • /
    • 2010
  • 차세대 멀티 레벨 셀 플래시 메모리들을 위해 복잡도가 낮은 에러 정정 코드 구현에 대한 요구가 커지고 있다. 일반적으로 부 표현 (sub-expression) 들을 공유하는 것은 복잡도와 칩 면적을 줄이기 위한 효과적인 방법이다. 본 논문에서는 직렬 선형 귀환 쉬프트 레지스터 구조를 기반으로 부 표현들을 이용한 저 복잡도 m-비트 병렬 BCH 인코더 구현 방법을 제안한다. 또한, 부 표현들을 탐색하기 위한 일반화된 방법을 제시한다. 부 표현들은 패리티 생성을 위해 사용하는 행렬(생성 행렬, generator matrix)의 부 행렬 (sub-matrix)과 다른 변수들의 합과의 행렬 연산에 의해 표현된다. 부 표현들의 수는 개로 한정되며, 탐색된 부 표현들은 다른 병렬 BCH 인코더 구현을 위해 공유되어질 수 있다. 본 논문은 구현 과정에서 다수의 팬 아웃에 의해 발생하는 문제점(지연)의 해결이 아닌 복잡도(로직 사이즈) 감소에 그 목적이 있다.

안테나 당 전력 제한 조건을 갖는 다중-입력 단일-출력 브로드캐스트 채널에서의 저복잡도 제로포싱 프리코더 설계 (Low Complexity Zero-Forcing Precoder Design for MISO Broadcast Channels Under Per-Antenna Power Constraints)

  • 박홍석;장진영;전상운;채혁진;차현수;김동현;김동구
    • 한국통신학회논문지
    • /
    • 제41권9호
    • /
    • pp.1010-1019
    • /
    • 2016
  • 안테나 당 전력 제한 조건을 갖는 K 사용자 다중-입력 단일-출력 브로드캐스트 채널을 고려한다. 즉, 각각의 송신 안테나가 개별적인 전력 제한 조건을 만족해야한다. 송신 안테나 수 M이 K보다 클 때의 저복잡도 제로포싱 프리코더를 제안한다. 제안하는 프리코더 설계기법은 최적 제로포싱 프리코더가 달성하는 합 전송률에 근접하는 전송률을 달성하며 동시에 프리코더 설계의 복잡도를 현저히 감소시킬 수 있다.

Near-Optimal Low-Complexity Hybrid Precoding for THz Massive MIMO Systems

  • Yuke Sun;Aihua Zhang;Hao Yang;Di Tian;Haowen Xia
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제18권4호
    • /
    • pp.1042-1058
    • /
    • 2024
  • Terahertz (THz) communication is becoming a key technology for future 6G wireless networks because of its ultra-wide band. However, the implementation of THz communication systems confronts formidable challenges, notably beam splitting effects and high computational complexity associated with them. Our primary objective is to design a hybrid precoder that minimizes the Euclidean distance from the fully digital precoder. The analog precoding part adopts the delay-phase alternating minimization (DP-AltMin) algorithm, which divides the analog precoder into phase shifters and time delayers. This effectively addresses the beam splitting effects within THz communication by incorporating time delays. The traditional digital precoding solution, however, needs matrix inversion in THz massive multiple-input multiple-output (MIMO) communication systems, resulting in significant computational complexity and complicating the design of the analog precoder. To address this issue, we exploit the characteristics of THz massive MIMO communication systems and construct the digital precoder as a product of scale factors and semi-unitary matrices. We utilize Schatten norm and Hölder's inequality to create semi-unitary matrices after initializing the scale factors depending on the power allocation. Finally, the analog precoder and digital precoder are alternately optimized to obtain the ultimate hybrid precoding scheme. Extensive numerical simulations have demonstrated that our proposed algorithm outperforms existing methods in mitigating the beam splitting issue, improving system performance, and exhibiting lower complexity. Furthermore, our approach exhibits a more favorable alignment with practical application requirements, underlying its practicality and efficiency.

저전력 고속 NCL 비동기 게이트 설계 (Design of Low Power and High Speed NCL Gates)

  • 김경기
    • 전자공학회논문지
    • /
    • 제52권2호
    • /
    • pp.112-118
    • /
    • 2015
  • 기존의 동기방식의 회로는 나노미터 영역에서의 공정, 전압, 온도 변이 (PVT variation), 그리고 노화의 영향으로 시스템의 전체 성능을 유지할 수 없을 뿐만 아니라 올바른 동작을 보장할 수도 없다. 따라서 본 논문에서는 여러 가지 변이에 영향을 받지 않는 비동기회로 설계 방식 중에서 타이밍 분석이 요구되지 않고, 설계가 간단한 DI(delay insentive) 방식의 NCL (Null Convention Logic) 설계 방식을 이용하여 디지털 시스템을 설계하고자 한다. 기존의 NCL 게이트들의 회로 구조들은 느린 스피드, 높은 영역 오버헤드, 높은 와이어(wire) 복잡도와 같은 약점을 가지고 있기 때문에 본 논문에서는 빠른 스피드, 낮은 영역 오버헤드, 낮은 와이더 복잡도를 위해서 트랜지스터 레벨에서 설계된 새로운 저전력 고속 NCL 게이트 라이브러리를 제안하고자 한다. 제안된 NCL 게이트들은 동부 0.11um 공정으로 구현된 비동기 방식의 곱셈기의 지연, 소모 전력에 의해서 기존의 NCL 게이트 들과 비교되었다.

低電力 MCU core의 設計에 對해

  • 안형근;정봉영;노형래
    • 전자공학회지
    • /
    • 제25권5호
    • /
    • pp.31-41
    • /
    • 1998
  • With the advent of portable electronic systems, power consumption has recently become a major issue in circuit and system design. Furthermore, the sophisticated fabrication technology makes it possible to embed more functions and features in a VLSI chip, consequently calling for both higher performance and lower power to deal with the ever growing complexity of system algorithms than in the past. VLSI designers should cope with two conflicting constraints, high performance and low power, offering an optimum trade off of these constraints to meet requirements of system. Historically, VLSI designers have focused on performance improvement, and power dissipation was not a design criteria but an afterthought. This design paradigm should be changed, as power is emerging as the most critical design constraint. In VLSI design, low power design can be accomplished through many ways, for instance, process, circuit/logic design, architectural design, and etc.. In this paper, a few low power design examples, which have been used in 8 bit micro-controller core, and can be used also in 4/16/32 bit micro-controller cores, are presented in the areas of circuit, logic and architectural design. We first propose a low power guidelines for micro-controller design in SAMSUNG, and more detailed design examples are followed applying 4 specific design guidelines. The 1st example shows the power reduction through reduction of number of state clocks per instruction. The 2nd example realized the power reduction by applying RISC(Reduced Instruction Set Computer) concept. The 3rd example is to optimize the algorithm for ALU(Arithmetic Logic Unit) to lower the power consumption, Lastly, circuit cells designed for low power are described.

  • PDF

Low-Complexity Massive MIMO Detectors Based on Richardson Method

  • Kang, Byunggi;Yoon, Ji-Hwan;Park, Jongsun
    • ETRI Journal
    • /
    • 제39권3호
    • /
    • pp.326-335
    • /
    • 2017
  • In the uplink transmission of massive (or large-scale) multi-input multi-output (MIMO) systems, large dimensional signal detection and its hardware design are challenging issues owing to the high computational complexity. In this paper, we propose low-complexity hardware architectures of Richardson iterative method-based massive MIMO detectors. We present two types of massive MIMO detectors, directly mapped (type1) and reformulated (type2) Richardson iterative methods. In the proposed Richardson method (type2), the matrix-by-matrix multiplications are reformulated to matrix-vector multiplications, thus reducing the computational complexity from $O(U^2)$ to O(U). Both massive MIMO detectors are implemented using a 65 nm CMOS process and compared in terms of detection performance under different channel conditions (high-mobility and flat fading channels). The hardware implementation results confirm that the proposed type1 Richardson method-based detector demonstrates up to 50% power savings over the proposed type2 detector under a flat fading channel. The type2 detector indicates a 37% power savings compared to the type1 under a high-mobility channel.

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.

Conceptual Design Optimization of Tensairity Girder Using Variable Complexity Modeling Method

  • Yin, Shi;Zhu, Ming;Liang, Haoquan;Zhao, Da
    • International Journal of Aeronautical and Space Sciences
    • /
    • 제17권1호
    • /
    • pp.29-36
    • /
    • 2016
  • Tensairity girder is a light weight inflatable fabric structural concept which can be used in road emergency transportation. It uses low pressure air to stabilize compression elements against buckling. With the purpose of obtaining the comprehensive target of minimum deflection and weight under ultimate load, the cross-section and the inner pressure of tensairity girder was optimized in this paper. The Variable Complexity Modeling (VCM) method was used in this paper combining the Kriging approximate method with the Finite Element Analysis (FEA) method, which was implemented by ABAQUS. In the Kriging method, the sample points of the surrogate model were outlined by Design of Experiment (DOE) technique based on Optimal Latin Hypercube. The optimization framework was constructed in iSIGHT with a global optimization method, Multi-Island Genetic Algorithm (MIGA), followed by a local optimization method, Sequential Quadratic Program (SQP). The result of the optimization gives a prominent conceptual design of the tensairity girder, which approves the solution architecture of VCM is feasible and efficient. Furthermore, a useful trend of sensitivity between optimization variables and responses was performed to guide future design. It was proved that the inner pressure is the key parameter to balance the maximum Von Mises stress and deflection on tensairity girder, and the parameters of cross section impact the mass of tensairity girder obviously.

기약 AOP를 이용한 GF(2m)상의 낮은 지연시간의 시스톨릭 곱셈기 (Low Latency Systolic Multiplier over GF(2m) Using Irreducible AOP)

  • 김기원;한승철
    • 대한임베디드공학회논문지
    • /
    • 제11권4호
    • /
    • pp.227-233
    • /
    • 2016
  • Efficient finite field arithmetic is essential for fast implementation of error correcting codes and cryptographic applications. Among the arithmetic operations over finite fields, the multiplication is one of the basic arithmetic operations. Therefore an efficient design of a finite field multiplier is required. In this paper, two new bit-parallel systolic multipliers for $GF(2^m)$ fields defined by AOP(all-one polynomial) have proposed. The proposed multipliers have a little bit greater space complexity but save at least 22% area complexity and 13% area-time (AT) complexity as compared to the existing multipliers using AOP. As compared to related works, we have shown that our multipliers have lower area-time complexity, cell delay, and latency. So, we expect that our multipliers are well suited to VLSI implementation.