• 제목/요약/키워드: Complexity System

검색결과 3,518건 처리시간 0.038초

Algorithm for Improving the Computing Power of Next Generation Wireless Receivers

  • Rizvi, Syed S.
    • Journal of Computing Science and Engineering
    • /
    • 제6권4호
    • /
    • pp.310-319
    • /
    • 2012
  • Next generation wireless receivers demand low computational complexity algorithms with high computing power in order to perform fast signal detections and error estimations. Several signal detection and estimation algorithms have been proposed for next generation wireless receivers which are primarily designed to provide reasonable performance in terms of signal to noise ratio (SNR) and bit error rate (BER). However, none of them have been chosen for direct implementation as they offer high computational complexity with relatively lower computing power. This paper presents a low-complexity power-efficient algorithm that improves the computing power and provides relatively faster signal detection for next generation wireless multiuser receivers. Measurement results of the proposed algorithm are provided and the overall system performance is indicated by BER and the computational complexity. Finally, in order to verify the low-complexity of the proposed algorithm we also present a formal mathematical proof.

A study on convergence and complexity of reproducing kernel collocation method

  • Hu, Hsin-Yun;Lai, Chiu-Kai;Chen, Jiun-Shyan
    • Interaction and multiscale mechanics
    • /
    • 제2권3호
    • /
    • pp.295-319
    • /
    • 2009
  • In this work, we discuss a reproducing kernel collocation method (RKCM) for solving $2^{nd}$ order PDE based on strong formulation, where the reproducing kernel shape functions with compact support are used as approximation functions. The method based on strong form collocation avoids the domain integration, and leads to well-conditioned discrete system of equations. We investigate the convergence and the computational complexity for this proposed method. An important result obtained from the analysis is that the degree of basis in the reproducing kernel approximation has to be greater than one for the method to converge. Some numerical experiments are provided to validate the error analysis. The complexity of RKCM is also analyzed, and the complexity comparison with the weak formulation using reproducing kernel approximation is presented.

Fixed-Complexity Sphere Encoder for Multi-User MIMO Systems

  • Mohaisen, Manar;Chang, Kyung-Hi
    • Journal of Communications and Networks
    • /
    • 제13권1호
    • /
    • pp.63-69
    • /
    • 2011
  • In this paper, we propose a fixed-complexity sphere encoder (FSE) for multi-user multi-input multi-output (MU-MIMO) systems. The proposed FSE accomplishes a scalable tradeoff between performance and complexity. Also, because it has a parallel tree-search structure, the proposed encoder can be easily pipelined, leading to a tremendous reduction in the precoding latency. The complexity of the proposed encoder is also analyzed, and we propose two techniques that reduce it. Simulation and analytical results demonstrate that in a $4{\times}4$ MU-MIMO system, the proposed FSE requires only 11.5% of the computational complexity needed by the conventional QR decomposition with M-algorithm encoder (QRDM-E). Also, the encoding throughput of the proposed encoder is 7.5 times that of the QRDM-E with tolerable degradation in the BER performance, while achieving the optimum diversity order.

회로 복잡도를 개선한 AOP 기반의 GF(2$^{m}$ ) 승산기 (Low Complexity GF(2$^{m}$ ) Multiplier based on AOP)

  • 변기영;성현경;김흥수
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2003년도 하계종합학술대회 논문집 V
    • /
    • pp.2633-2636
    • /
    • 2003
  • This study focuses on the new hardware design of fast and low-complexity multiplier over GF(2$\^$m/). The proposed multiplier based on the irreducible all one polynomial (AOP) of degree m, to reduced the system's complexity. It composed of Cyclic Shift, Partial Product, and Modular Summation Blocks. Also it consists of (m+1)$^2$2-input AND gates and m(m+1) 2-input XOR gates. Out architecture is very regular, modular and therefore, well-suited for VLSI implementation.

  • PDF

정보시스템을 통한 정보공유에 영향을 미치는 상황요인 (Contextual Factors Affecting the Information Sharing through Information Systems)

  • 강재정
    • Asia pacific journal of information systems
    • /
    • 제11권2호
    • /
    • pp.141-158
    • /
    • 2001
  • This paper examines the effects of environmental uncertainty, structural decentralization, formalization, complexity and task interdependence on the information sharing through information system. 197 firms in Korea are surveyed and analyzed to investigate the relationship between the contextual variables and the information sharing. The result of multiple regression analysis shows that task interdependence, structural decentralization, complexity are significant factors to influence on the Information Sharing. Also, additional analysis shows that task interdependence, structural decentralization are major factors in service industry, and task interdependence, structural complexity are in manufacturing industry.

  • PDF

Improvement of Group Delay and Reduction of Computational Complexity in Linear Phase IIR Filters

  • Varasumanta, Saranuwaj;Sookcharoenphol, Dolchai;Sriteraviroj, Uthai;Janjitrapongvej, Kanok;Kanna, Channarong
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2003년도 ICCAS
    • /
    • pp.955-959
    • /
    • 2003
  • A technique for realizing linear phase IIR filters has been proposed by Powell-Chau which gives a real-time implementation of H(z-1).H(z), where H(z) is a causal nonlinear phase IIR filter. Powell-Chau system is linear but not timeinvariant system. Therefore, that system has group delay response that exhibits a minor sinusoidal variation superimposed on a constant value. In the signal processing, this oscillation seriously degrade the signal quality. Unfortunately, that system has a large sample delay of 4L and also more computational complexity. Proposed system is present a reduced computational complexity technique by moved the numerator polynomial of H(1/z) out to cascade with causal filter H(z) and remain only all-pole of H(1/z), then applied truncated infinite impulse response to finite with truncated IIR filtel $H_L$(z) and L sample delay to subtract the output sequence from the top and bottom filter. Proposed system is linear time invariance and group delay response and total harmonic distortion are also improved.

  • PDF

Combination of Array Processing and Space-Time Coding In MC-CDMA System

  • Hung Nguyen Viet;Fernando W. A. C
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2004년도 ICEIC The International Conference on Electronics Informations and Communications
    • /
    • pp.302-309
    • /
    • 2004
  • The transmission capacity of wireless communication systems may become dramatically high by employ multiple transmit and receive antennas with space-time coding techniques appropriate to multiple transmit antennas. For large number of transmit antennas and at high bandwidth efficiencies, the receiver may become too complex whenever correlation across transmit antennas is introduced. Reducing decoding complexity at receiver by combining array processing and space-time codes (STC) helps a communication system using STC to overcome the big obstacle that prevents it from achieving a desired high transmission rate. Multi-carrier CDMA (MC-CDMA) allows providing good performance in a channel with high inter-symbol interference. Antenna array, STC and MC-CDMA system have a similar characteristic that transmit-receive data streams are divided into sub-streams. Thus, there may be a noticeable reduction of receiver complexity when we combine them together. In this paper, the combination of array processing and STC in MC-CDMA system over slow selective-fading channel is investigated and compared with corresponding existing MC-CDMA system using STC. A refinement of this basic structure leads to a system design principle in which we have to make a trade off between transmission rate, decoding complexity, and length of spreading code to reach a given desired design goal.

  • PDF

시스템적 사고에 기반한 사회 시스템의 이해와 응용 : Cellular Automata를 이용한 협력모형을 중심으로 (Understanding and application of the social system based on the system thinking : Focus on the cooperation model using Cellular Automata)

  • 고길곤
    • 한국시스템다이내믹스연구
    • /
    • 제1권1호
    • /
    • pp.133-157
    • /
    • 2000
  • This paper deals with the social system from the point of system thinking consisting the fundamental construct of system dynamics. The Bertalanffy's general system theory, having been criticized because of its ambiguity, and the complex science theory, emerging system theory, are integrated by using the system thinking which is characterized with three concepts, 'feedback thinking', 'dynamic thinking', 'operational thinking'. In the integration, system thinking suggests the dynamic pattern of the social system have not only an equilibrium status but also complex status. The science of complexity gives an implication to system dynamics the important of the uncertainty and complexity if we interpret the social system as an open system. To show more concrete description, I simulate the cooperation model based on the iterated prisoner dilemma. The simulation results show the diverse patterns of cooperation and betrayal. Especially the sensitivity of initial payoff will cause the chaotic strategic landscapes as the game gose on. These results mean that we should not give the hasty prescription to control social system artificially. Because social system retains the self-organizing force in itself.

  • PDF

시각물체 추적 시스템을 위한 멀티코어 프로세서 기반 태스크 스케줄링 방법 (A Task Scheduling Strategy in a Multi-core Processor for Visual Object Tracking Systems)

  • 이민채;장철훈;선우명호
    • 한국자동차공학회논문집
    • /
    • 제24권2호
    • /
    • pp.127-136
    • /
    • 2016
  • The camera based object detection systems should satisfy the recognition performance as well as real-time constraints. Particularly, in safety-critical systems such as Autonomous Emergency Braking (AEB), the real-time constraints significantly affects the system performance. Recently, multi-core processors and system-on-chip technologies are widely used to accelerate the object detection algorithm by distributing computational loads. However, due to the advanced hardware, the complexity of system architecture is increased even though additional hardwares improve the real-time performance. The increased complexity also cause difficulty in migration of existing algorithms and development of new algorithms. In this paper, to improve real-time performance and design complexity, a task scheduling strategy is proposed for visual object tracking systems. The real-time performance of the vision algorithm is increased by applying pipelining to task scheduling in a multi-core processor. Finally, the proposed task scheduling algorithm is applied to crosswalk detection and tracking system to prove the effectiveness of the proposed strategy.

시스템 안전성평가를 통한 효율적 요건 도출방안 연구 (A Study on the Safety Requirements Establishment through System Safety Processes)

  • 유승우;정진평;이백준
    • 항공우주시스템공학회지
    • /
    • 제7권2호
    • /
    • pp.29-34
    • /
    • 2013
  • Safety requirements for aircraft and system functions include minimum performance constraints for both availability and integrity of the function. These safety requirements should be determined by conducting a safety assessment. The depths and contents of aircraft system safety assessment vary depending on factors such as the complexity of the system, how critical the system is to flight safety, what volume of experience is available on the type of system and the novelty and complexity of the technologies being used. Requirements that are defined to prevent failure conditions or to provide safety related functions should be uniquely identified and traceable through the levels of development. This will ensure visibility of the safety requirements at the software and electronic hardware design level. This paper has prepared to study on promoting the efficiency of establishing hierarchical safety requirements from aircraft level function to item level through system safety processes.