• Title/Summary/Keyword: data complexity

Search Result 2,379, Processing Time 0.032 seconds

A Novel Adaptive Turbo Receiver for Large-Scale MIMO Communications

  • Chang, Yu-Kuan;Ueng, Fang-Biau;Tsai, Bo-Yi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.7
    • /
    • pp.2998-3017
    • /
    • 2018
  • Massive (large-scale) MIMO (multiple-input multiple-output) is one of the key technologies in next-generation wireless communication systems. This paper proposes a high-performance low-complexity turbo receiver for SC-FDMA (single-carrier frequency-division multiple access) based MMIMO (massive MIMO) systems. Because SC-FDMA technology has the desirable characteristics of OFDMA (orthogonal frequency division multiple access) and the low PAPR (peak-to-average power ratio) of SC transmission schemes, the 3GPP LTE (long-term evolution) has adopted it as the uplink transmission to meet the demand high data rate and low error rate performance. The complexity of computing will be increased greatly in base station with massive MIMO (MMIMO) system. In this paper, a low-complexity adaptive turbo equalization receiver based on normalized minimal symbol-error-rate for MMIMO SC-FDMA system is proposed. The proposed receiver is with low complexity than that of the conventional turbo MMSE (minimum mean square error) equalizer and is also with better bit error rate (BER) performance than that of the conventional adaptive turbo MMSE equalizer. Simulation results confirm the effectiveness of the proposed scheme.

Low Computational Algorithm of Soft-Decision Extended BCH Decoding Algorithm for Next Generation DVB-RCS Systems (차세대 DVB-RCS 시스템을 위한 저 계산량 연판정 e-BCH 복호 알고리즘)

  • Park, Tae-Doo;Kim, Min-Hyuk;Lim, Byeong-Su;Jung, Ji-Won
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.22 no.7
    • /
    • pp.705-710
    • /
    • 2011
  • In this paper, we proposed the low computational complexity soft-decision e-BCH decoding algorithm based on the Chase algorithm. In order to make the test patterns, it is necessary to re-order the least reliable received symbols. In the process of ordering and finding optimal decoding symbols, high computational complexity is required. Therefore, this paper proposes the method of low computational complexity algorithm for soft-decision e-BCH decoding process.

A Study on the Production Environment of Apparel Manufacture (의류제조업체의 생산환경에 관한 연구)

  • Sun-Hee Lee;Mi-A Suh
    • The Research Journal of the Costume Culture
    • /
    • v.8 no.1
    • /
    • pp.30-39
    • /
    • 2000
  • The purpose of this study were to 1) identify types and levels of production environments, 2) classify apparel manufacturers based on production environments and 3) investigate relationship between characteristics of apparel manufacturers and production environment. Apparel manufacturer's characteristics included product line and the number of employees. For this study, the questionnaires were administered to 215 apparel manufacturers in seoul and Kyung-gi region from Feb. to Mar. 1998. Employing a sample of 201, data were analyzed by factor analysis, descriptive statistics, cluster analysis, cluster analysis, discriminant Analysis, and multivariate analysis of variance. The following are the results of this study : 1. The production environment was identified as three types such as complexity of product environment, uncertainty of demand/supply environment and uncertainty of worker environment. 2. Based on three types of the production environment, apparel manufacturers were classified into stable group, uncertain group and complicated group. 3. With respect to product line, men's wear manufacturers were lied the most high complexity of product environment, casual wear and knit wear were lied the most frequently uncertainty of worker environment. With respect to the number employees, apparel manufacturers comprising 50∼99 employees were lied the most high complexity of product environment, while those comprising 100∼299 employees the most high demand/supply environment.

  • PDF

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)
    • /
    • v.13 no.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.

A fast decoding algorithm using data dependence in fractal image (프래탈 영상에서 데이타 의존성을 이용한 고속 복호화 알고리즘)

  • 류권열;정태일;강경원;권기룡;문광석
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.10
    • /
    • pp.2091-2101
    • /
    • 1997
  • Conventional method for fractal image decoding requires high-degree computational complexity in decoding propocess, because of iterated contractive transformations applied to whole range blocks. In this paper, we propose a fast decoding algorithm of fractal image using data depence in order to reduce computational complexity for iterated contractive transformations. Range of reconstruction image is divided into a region referenced with domain, called referenced range, and a region without reference to domain, called unreferenced range. The referenced range is converged with iterated contractive transformations, and the unreferenced range can be decoded by convergence of the referenced range. Thus the unreferenced range is called data dependence region. We show that the data dependence region can be deconded by one transformation when the referenced range is converged. Consequently, the proposed method reduces computational complexity in decoding process by executing iterated contractive transformations for the referenced range only.

  • PDF

A Comparison of the Search Based Testing Algorithm with Metrics (메트릭에 따른 탐색 기반 테스팅 알고리즘 비교)

  • Choi, HyunJae;Chae, HeungSeok
    • Journal of KIISE
    • /
    • v.43 no.4
    • /
    • pp.480-488
    • /
    • 2016
  • Search-Based Software Testing (SBST) is an effective technique for test data generation on large domain size. Although the performance of SBST seems to be affected by the structural characteristics of Software Under Test (SUT), studies for the comparison of SBST techniques considering structural characteristics are rare. In addition to the comparison study for SBST, we analyzed the best algorithm with different structural characteristics of SUT. For the generalization of experimental results, we automatically generated 19,800 SUTs by combining four metrics, which are expected to affect the performance of SBST. According to the experiment results, Genetic algorithm showed the best performance for SUTs with high complexity and test data evaluation with count ${\leq}20,000$. On the other hand, the genetic simulated annealing and the simulated annealing showed relatively better performance for SUTs with high complexity and test data evaluation with count ${\geq}50,000$. Genetic simulated annealing, simulated annealing and hill climbing showed better performance for SUTs with low complexity.

Fractal Analysis of Urban Morphology Considering Distributed Situation of Buildings (건물분포를 고려한 도시형태의 프랙털(Fractal) 해석)

  • Moon, Tae-Heon
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.8 no.3
    • /
    • pp.1-10
    • /
    • 2005
  • The purpose of this paper is to conduct an experimental measurement and analysis of cities' morphology. Fractal theory that is an effective tool for evaluating self-similarity and complexity of objects was applied. For the comparative analysis of fractailities and computational verification, two totally different cities in Japan were selected. They are Kitakyushu City, which is a big and fully developed city, and Jinguu Machi of which almost all the area is covered with agricultural land use. After converting vector data to raster data within GIS, fractal dimensions of two cases in Kitakyushu City and one case in Jinguu Machi were calculated. The calculation showed that two parts of Kitakyushu City were already fractal. Jinguu Machi, however, was difficult to find fractality. As a conclusion, fractal was proved to be an useful tool to estimate the shape of cities reflecting their internal spatial structure, that is self-similarity and complexity.

  • PDF

Study of Digital Analysis Efficiency through a Complexity Analysis (복잡성 분석을 통한 디지털 분석의 유효성에 관한 연구)

  • 이혁준;이종석
    • Korean Institute of Interior Design Journal
    • /
    • no.31
    • /
    • pp.56-63
    • /
    • 2002
  • This study intends to prepare a system that can be used, by applying digital technique, in analyzing complexity of architectural forms that have been visualized by the correlation based on the distribution chart made in accordance with profile lines. The profile lines are derived from the edge analysis of the architectural forms, simplified based on the visual theory. For the purpose, this study was conducted in the following ways: First, problems of the existing models for the elevation analysis were examined along with formal analysis based on visual recognition to consider the profile lines derived from the forms. Secondly, in elevation analysis, profile lines were derived by digital method to measure them qualitatively. To verify the objectivity of the measured data value, a survey was conducted based on the adjective cataloging method, and the correlation of the survey result and analyzed data was analyzed to verify the validity of the derived data. Thirdly, supplementation for the problems deducted from experiments and the possibility to use it in designing were suggested. Digital method has many advantages over the conventional analyzing system in deriving precise data value by excluding subjectivity. It also allows various analytical methods in analyzing numerous data repeatedly. Diversified models and methods of analysis considering numerous factors arising in the process of designing remain assignments to research in future.

Comparison of Pruning Method for Revised Analog Concept Learning System (ACLS의 개선을 위한 전지(剪枝)방법의 비교)

  • Yim, Sung-Sic;Kwon, Young-Sik;Kim, Nam-Ho
    • IE interfaces
    • /
    • v.10 no.2
    • /
    • pp.15-28
    • /
    • 1997
  • Knowledge acquisition has been a major bottleneck in building expert systems. To ease the problems arising in knowledge acquisition, analog concept learning systems(ACLS) has been used. In this paper, in order to avoid the overfitting problem and secure a good performance, we propose the revised ACLS, which pruning methods -cost complexity, reduced error, pessimistic pruning and production rule- are incorporated into and apply them to the credit evaluation for Korean companies. The performances of the revised ACLS are evaluated in light of the prediction accuracy. To check the effect of the training data sampling on the performance, experiments are conducted using the different proportion of the training data. Experimental results show that the revised ACLS of combining cost complexity pruning with reduced error pruning performs best among original ACLS and other methods.

  • PDF

Open Loop Responses of Posture Complexity in Biomechanics

  • Shin, Youngkyun;Park, Gu-Bum
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.27 no.8
    • /
    • pp.42-50
    • /
    • 2013
  • The reactionary responses to control human standing dynamics were estimated under the assumption that postural complexity mainly occurs in the mid-sagittal plane. During the experiment, the subject was exposed to continuous horizontal perturbation. The ankle and hip joint rotations of the subject mainly contributed to maintaining standing postural control. The designed mobile platform generated anterior/posterior (AP) motion. Non-predictive random translation was used as input for the system. The mean acceleration generated by the platform was measured as $0.44m/s^2$. The measured data were analyzed in the frequency domain by the coherence function and the frequency response function to estimate its dynamic responses. The significant correlation found between the input and output of the postural control system. The frequency response function revealed prominent resonant peaks within its frequency spectrum and magnitude. Subjects behaved as a non-rigid two link inverted pendulum. The analyzed data are consistent with the outcome hypothesized for this study.