• Title, Summary, Keyword: 복잡도

Search Result 15,852, Processing Time 0.063 seconds

A Low-Complexity ML Detector for Generalized Spatial Modulation Based on Priority (GSM을 위한 우선순위 기반 저복잡도 ML 검출 기법)

  • Lee, Man Hee;Shin, Soo Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.42 no.4
    • /
    • pp.731-738
    • /
    • 2017
  • In this paper, we proposed a modified ML detector for generalized spatial modulation which is a method among Multiple-input Multiple-output. This proposed method detects signal applying modified channel statement information based on priority. Complexity in conventional methods increases as increasing the number of active antennas. To solve this problem, we proposed a new ML method using static channel information decided by the number of transmit antennas and the number of receive antennas. This method detects active antennas one by one through priority. The proposed method has proved benefit on complexity compared with conventional method through simulations. When the number of transmit antennas is equal to 10, there is approximately 45% complexity reduction.

Low-complexity implementation of OFDMA timing delay detector with multiple receive antennas for broadband wireless access (광대역 무선 액세스를 위한 다중 수신안테나를 갖는 OFDMA 시스템의 낮은 복잡도의 타이밍 딜레이 추정기 구현)

  • Won, Hui-Chul
    • Journal of the Korea Industrial Information Systems Research
    • /
    • v.12 no.3
    • /
    • pp.19-30
    • /
    • 2007
  • In this paper, we propose low-complexity implementation of orthogonal frequency division multiple access (OFDMA) timing delay detector with multiple receive antennas for broadband wireless access (BWA). First, in order to reduce the computational complexity, the detection structure which rotates the phase of the received ranging symbols is introduced. Second, we propose the detection structure with the N-point/M-interval fast Fourier transform structure and a frequency-domain average-power estimator for complexity reduction without sacrificing the system performance. Finally, simulation results for the proposed structures and complexity comparison of the existing structure with the proposed detectors are presented.

  • PDF

An Efficient Partial Detection Scheme for MIMO-OFDM Systems (MIMO-OFDM 시스템에서 효율성을 위한 분할 검출 기법)

  • Kang, Sung-jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.9
    • /
    • pp.1722-1724
    • /
    • 2015
  • This paper proposes a partial detection scheme using QRD-M, DFE, and iterative schemes for efficiency in terms of detection performance and complexity in a MIMO-OFDM system. The proposed scheme detects signals by using the different detection methods in according to spatial stream. In the proposed scheme, QRD-M with high detection performance and high complexity is used in spatial stream that requires low complexity, and DFE with low detection performance and low complexity is used in spatial stream that requires high complexity. Also, the iterative detection is performed in the detected spatial stream by using DFE. From the simulation, it is confirmed that although proposed scheme has increased complexity, detection performance is greatly improved by the proposed scheme.

Low Complexity Antenna Selection based MIMO Scheduling Algorithms for Uplink Multiuser MIMO/FDD System (상향링크 다중사용자 MIMO/FDD 시스템을 위한 낮은 복잡도의 안테나 선택 기반 MIMO 스케줄링 기법)

  • Kim, Yo-Han;Cho, Sung-Yoon;Lee, Taek-Ju;Kim, Dong-Ku
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.12C
    • /
    • pp.1164-1174
    • /
    • 2007
  • Antenna selection based MIMO schedulers are proposed to achieve the optimal performance with low complexity in uplink multiuser MIMO/FDD system. In this paper, three heuristic schedulers are proposed to approach the optimal performance which is achieved by the optimal Brute-Force Scheduler. Two search methods called sub-set and full-set way are also discussed to set up the antenna channels to be the candidates of the scheduler. Simulation results show that the sum rate and BER performance of the proposed CSS and SOAS schemes are about the same to that of the brute-force scheduler with affordable complexity, while RC-SOAS with further reduced complexity achieves almost the optimal performance in the case of small number of antennas. Moreover, the complexity can be additionally reduced by the sub-set search method when the number of transmit and receive antennas are 2 respectively, which is applicable in the realistic systems.

Binary Image Compression For Low-Complexity Applications (저복잡도를 갖는 이진 영상 압축 방법)

  • 조명훈;김수향;임재혁;정제창
    • Proceedings of the IEEK Conference
    • /
    • /
    • pp.689-692
    • /
    • 2000
  • 본 논문에서는 이동 통신에서 사용될 저 복잡도를 갖는 이진 영상 압축 알고리즘을 제안한다. 기존의 이진영상의 부호화에 사용되는 알고리즘에는 JBIG, G.4등과 같은 방식이 있으나, JBIG의 경우 산술 부호화로 인한 높은 복잡도를 필요로 하고, G.4의 경우 일반 A4 문서를 대상으로 하고 있어 이러한 알고리즘을 이동 통신에서 사용하기에는 부적합하다. 따라서 본 논문에서는 단순한 이진 영상에 대해서 낮은 복잡도를 가지며 기존의 부호화 방식들 보다 좋은 성능을 얻을 수 있는 효과적인 압축 방법을 제시한다.

  • PDF

Deblocking Filter for Low-complexity Video Decoder (저 복잡도 비디오 복호화기를 위한 디블록킹 필터)

  • Jo, Hyun-Ho;Nam, Jung-Hak;Jung, Kwang-Su;Sim, Dong-Gyu;Cho, Dae-Sung;Choi, Woong-Il
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.47 no.3
    • /
    • pp.32-43
    • /
    • 2010
  • This paper presents deblocking filter for low-complexity video decoder. Baseline profile of the H.264/AVC used for mobile devices such as mobile phones has two times higher compression performance than the MPEG-4 Visual but it has a problem of serious complexity as using 1/4-pel interpolation filter, adaptive entropy model and deblocking filter. This paper presents low-complexity deblocking filter for decreasing complexity of decoder with preserving the coding efficiency of the H.264/AVC. In this paper, the proposed low-complexity deblocking filter decreased 49% of branch instruction than conventional approach as calculating value of BS by using the CBP. In addition, a range of filtering of strong filter applied in intra macroblock boundaries was limited to two pixels. According to the experimental results, the proposed low-complexity deblocking filter decreased -0.02% of the BDBitrate comparison with baseline profile of the H.264/AVC, decreased 42% of the complexity of deblocking filter, and decreased 8.96% of the complexity of decoder.

The Embedding Synchronization Method in the Complex System (복잡계에서의 임베딩 구동 동기화 기법)

  • Bae, Young-Chul;Kim, Yi-Gon;Kim, Chen-Suk;Koo, Young-Duk
    • Journal of Korean Institute of Intelligent Systems
    • /
    • v.16 no.1
    • /
    • pp.18-23
    • /
    • 2006
  • The complex system synchronization methods improve based on synchronization theory; however, due to deeper level of complexity within complex system compared to that of chaos system, it is difficult to synchronize complex signals from complex system. In this paper, we proposed coupled-synchronization theory in the n-double scroll circuit and new embedding driven-synchronization theory, a method of accomplishing synchronization with only one parameter out of may parameters, in hyper-chaos circuit to apply synchronization in the complex system. By applying proposed synchronization method using computer simulation, we confirmed the accomplishment of superior synchronization in complex system.

A Study on the Complexity Measurement of Architecture Assets (아키텍처 자산의 복잡도 측정에 관한 연구)

  • Choi, Han-Yong
    • Journal of Convergence for Information Technology
    • /
    • v.7 no.5
    • /
    • pp.111-116
    • /
    • 2017
  • In this paper, we propose a method to measure the complexity of assets when a software component is constructed as a basic asset, a standardized design model is acquired, and a reusable extended asset is designed based on the standardized design model. However, each asset of our proposed asset management system consists of composite assets that combine assets of two domains. So this method can not make accurate measurements. Therefore, the complexity of the overall asset can be measured by reflecting the property value of the basic asset stored under the architecture. In conclusion, it is possible to measure the composite-complexity of a composed asset that is inversely proportional to cohesion and proportional to the cumulative sum of the associated values of each asset in the asset-related design.

Derivation of State Transition Diagram from Class Using Tree Structure (트리 형태를 이용한 클래스의 단계별 상태 다이어그램 도출 기법에 대한 연구)

  • Choi, Soo Kyung;Park, Young Bom
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.2 no.1
    • /
    • pp.19-26
    • /
    • 2013
  • To improve the reliability and quality of software system, many studies of the testing based on state-transition diagram have been in progress. Existing studies tried to solve the complexity problem of state-transition diagram. But the development of test case demands the better way to derive and manage the state diagram with low complexity. In this paper, the STMT(State-Transition Mapping Tree) is proposed to decrease the complexity of state diagram without changing or loosing the original state or transition information. Comparing with other methods, the proposed method turns out to be less complex.

Quality Metric for Classes in Object-Oriented Analysis Models (객체지향 분석 모델의 클래스 품질 척도)

  • 김유경;박재년
    • Proceedings of the Korean Information Science Society Conference
    • /
    • /
    • pp.457-459
    • /
    • 2000
  • 객체지향 방법론은 캡슐화(encapsulation), 상속(inherit), 다형성(polymorphism)과 같은 개념을 이용하기 때문에 기존의 절차적 방법론과는 다른 척도가 필요하다. 본 논문에서 제안하는 척도는 객체지향 시스템의 개발 절차 가운데 분석 단계에서 추출할 수 있는 정보만을 사용하여, 클래스가 객체지향 개념에 따라 잘 구성되었는지를 측량하게 된다. 이를 위하여 본 논문에서는 클래스의 품질을 측량하기 위한 척도로 협력의 복잡도와 인터페이스 복잡도를 제안한다. 협력의 복잡도는 클래스가 잠재적으로 얼마나 복잡할 수 있는지를 측량하기 위한 것으로서 클래스가 가지는 책임의 개수를 조사하여 정의된다. 인터페이스 복잡도는 클래스와 협력 관계에 있는 다른 클래스들의 인터페이스를 조사하여 정의된다. 제안된 척도는 기존의 척도들이 가지고 있는 문제점을 해결하기 위하여 이해하기 쉬운 수학적 명세를 용하였으며, 제안된 척도에 대한 수학적 증명과 사례 연구를 통한 검증을 하였다.

  • PDF