• Title/Summary/Keyword: complexity function

Search Result 824, Processing Time 0.029 seconds

Complexity Reduction Algorithm of Speech Coder(EVRC) for CDMA Digital Cellular System

  • Min, So-Yeon
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.12
    • /
    • pp.1551-1558
    • /
    • 2007
  • The standard of evaluating function of speech coder for mobile telecommunication can be shown in channel capacity, noise immunity, encryption, complexity and encoding delay largely. This study is an algorithm to reduce complexity applying to CDMA(Code Division Multiple Access) mobile telecommunication system, which has a benefit of keeping the existing advantage of telecommunication quality and low transmission rate. This paper has an objective to reduce the computing complexity by controlling the frequency band nonuniform during the changing process of LSP(Line Spectrum Pairs) parameters from LPC(Line Predictive Coding) coefficients used for EVRC(Enhanced Variable-Rate Coder, IS-127) speech coders. Its experimental result showed that when comparing the speech coder applied by the proposed algorithm with the existing EVRC speech coder, it's decreased by 45% at average. Also, the values of LSP parameters, Synthetic speech signal and Spectrogram test result were obtained same as the existing method.

  • PDF

THE SIMULTANEOUS APPROXIMATION ORDER BY NEURAL NETWORKS WITH A SQUASHING FUNCTION

  • Hahm, Nahm-Woo
    • Bulletin of the Korean Mathematical Society
    • /
    • v.46 no.4
    • /
    • pp.701-712
    • /
    • 2009
  • In this paper, we study the simultaneous approximation to functions in $C^m$[0, 1] by neural networks with a squashing function and the complexity related to the simultaneous approximation using a Bernstein polynomial and the modulus of continuity. Our proofs are constructive.

A NEW PRIMAL-DUAL INTERIOR POINT METHOD FOR LINEAR OPTIMIZATION

  • Cho, Gyeong-Mi
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.13 no.1
    • /
    • pp.41-53
    • /
    • 2009
  • A primal-dual interior point method(IPM) not only is the most efficient method for a computational point of view but also has polynomial complexity. Most of polynomialtime interior point methods(IPMs) are based on the logarithmic barrier functions. Peng et al.([14, 15]) and Roos et al.([3]-[9]) proposed new variants of IPMs based on kernel functions which are called self-regular and eligible functions, respectively. In this paper we define a new kernel function and propose a new IPM based on this kernel function which has $O(n^{\frac{2}{3}}log\frac{n}{\epsilon})$ and $O(\sqrt{n}log\frac{n}{\epsilon})$ iteration bounds for large-update and small-update methods, respectively.

  • PDF

Gaussian Noise Reduction Technique using Improved Kernel Function based on Non-Local Means Filter (비지역적 평균 필터 기반의 개선된 커널 함수를 이용한 가우시안 잡음 제거 기법)

  • Lin, Yueqi;Choi, Hyunho;Jeong, Jechang
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2018.11a
    • /
    • pp.73-76
    • /
    • 2018
  • A Gaussian noise is caused by surrounding environment or channel interference when transmitting image. The noise reduces not only image quality degradation but also high-level image processing performance. The Non-Local Means (NLM) filter finds similarity in the neighboring sets of pixels to remove noise and assigns weights according to similarity. The weighted average is calculated based on the weight. The NLM filter method shows low noise cancellation performance and high complexity in the process of finding the similarity using weight allocation and neighbor set. In order to solve these problems, we propose an algorithm that shows an excellent noise reduction performance by using Summed Square Image (SSI) to reduce the complexity and applying the weighting function based on a cosine Gaussian kernel function. Experimental results demonstrate the effectiveness of the proposed algorithm.

  • PDF

A STUDY THE IMPROVEMENT OF AREA COMPLEXITY OF HOPFILED NETWORK (홉필드 신경회로망의 Area Complexity 개선에 관한 연구)

  • Kim, Bo-Yeon;Hwang, Hee-Yeung;Lee, Chong-Ho
    • Proceedings of the KIEE Conference
    • /
    • 1990.07a
    • /
    • pp.532-534
    • /
    • 1990
  • We suggest a new energy function that improves the area complexity of the Hopfield Crossbar Network. Through converting data representation to an encoded format, we reduce the number of nodes of the network, and thus reduce the entire size. We apply this approach to the layer assignment problem, and use the modified delayed self-feedback Hopfield Network. Area complexity of the existing network for layer assignment ploblem is improved from O( $N^2L^2$ ) to O($N^2$(log L)$^2$).

  • PDF

Perception of Healthcare Design Complexity and Specialized Knowledge in Need (의료시설 디자인의 복잡성과 필요전문지식의 인식)

  • Kim, Duk-Su
    • Journal of The Korea Institute of Healthcare Architecture
    • /
    • v.11 no.1
    • /
    • pp.15-22
    • /
    • 2005
  • Healthcare design has been considered as one of the most complex design types. In this study, healthcare design complexity is analysed by the following categories: (1) function; (2) medical technology; (3) scientific knowledge; (4) aesthetics; and (5) interest group complexity. The central questions here are: (1) What is the impact of specialized knowledge on the professional practice; and (2) What are the relationships between design complexity and specialized knowledge. To answer these questions, this study utilizes two approaches, including mail-out questionnaires survey and in-person and focus group interviews. This study found that healthcare design architects emphasize the technical component of specialized healthcare design knowledge. Thus they perceive that architectural research, as a tool to increase specialized healthcare design knowledge, is beneficial to solve the technical components including medical technology and functional problems. In the professional practice, however, architectural research is hardly conducted due mainly to the lack of money and time for it. Different perceptions regarding healthcare design complexity and architectural research among the firms exist, depending on the firm size. These results imply that the knowledge management strategy of large firms can be more efficient to the organizational growth than the small firms.

  • PDF

Regression Analysis of the Relationships between Complexity Metrics and Faults on the Telecommunication Program (통신 소프트웨어의 프로그램 결함과 복잡도의 관련성 분석을 위한 회귀분석 모델)

  • Lee, Gyeong-Hwan;Jeong, Chang-Sin;Hwang, Seon-Myeong;Jo, Byeong-Gyu;Park, Ji-Hun;Kim, Gang-Tae
    • Journal of KIISE:Software and Applications
    • /
    • v.26 no.11
    • /
    • pp.1282-1287
    • /
    • 1999
  • 통신 프로그램은 고도의 신뢰성과 기능성, 확장성, 그리고 유지 보수성이 필요하다. 프로그램 테스트의 결과와 McCabe의 Complexity를 측정한 데이타를 가지고 회귀모델을 만들고 그 신뢰성을 분석함으로서 프로그램의 결함과 복잡도의 관련성을 평가한다.본 연구에서 사용한 통신 프로그램은 500개 블록이 59가지 기능을 수행하는 교환 기능 중에서 복잡도가 너무 많아서 통계 처리의 bias가 될 블록을 제외하고 394 블록을 선정하여 SAS에 의해서 통계 분석을 하고 회귀 분석 모델을 설계하였다. t 분포에 의하여 방정식의 유의성 수준을 검증하고 프로그램의 결함수에 가장 큰 영향을 주고 있는 복잡도가 McCabe의 복잡도와 설계 복잡도 임을 밝혀냈다. 이 연구 결과에 의해서 설계 정보 및 유지 보수 정보를 얻을 수 있다. Abstract Switching software requires high reliability, functionality, extendability and maintainability. For doing, software quality model based on MaCabe's complexity measure is investigated. It is experimentally shown using regression analysis the program fault density depends on the complexity and size of the function unit. The software should be verified and tested if it satisfies its requirements with automated analysis tools. In this paper we propose the regression model with the test data.The sample program for the regression model consists of more than 500 blocks, where each block compose of 10 files, which has 59 functions of switching activity.Among them we choose 394 blocks and analyzed for 59 functions by testing tools and SAS package. We developed Regression Analysis Model and evaluated significant of the equation based on McCabe's cyclomatic complexity, block design complexity, design complexity, and integration complexity.The results of our experimental study are that number of fault are under the influence of McCabe's complexity number and design complexity.

A Study on the Roles of Shape Properties in Evaluation of Aesthetics values on Shapes (형태속성이 미학 특성 인지 과정에 미치는 영향에 관한 연구)

  • Cha Myung-Yeol
    • Korean Institute of Interior Design Journal
    • /
    • v.14 no.2 s.49
    • /
    • pp.197-205
    • /
    • 2005
  • In estimating designed architectural buildings, many factors in various design domains such as function, structure, form, environment may be considered and then a building design might be selected or modified as final design from many possible design results. This paper proposed a method to obtain complexity values from two dimensional drawings which are floor plans or elevations. The Complexity values could be turned into esthetic values. The method has been developed based on information theory, shape pattern representation and cognitive theory. Results of measuring complexity value can make the computer evaluate and select final results produced from automatic design processes by the computer That is to say, aesthetic values based on order and chaos can be measured using complexity values and then some results having superior values can be selected as final result. Also some cognitive processes as perception of two dimensional drawings are discussed using shape representations. Aesthetic values could be varied in terms of shape properties such as size, individualities and knowledge as well as order and chaos.

A study on the visual preference prediction of interiors (실내공간에서의 시각적 선호도 예측에 관한 연구)

  • 노정실;김유일
    • Journal of the Korean Institute of Landscape Architecture
    • /
    • v.26 no.2
    • /
    • pp.269-282
    • /
    • 1998
  • The visual preference of interiors focusing on lobbies was investigated as a function of six predictor variable on the base of the Informational Approach: complexity, coherence, mystery, spaciousness, brightness, plant. The Common Fcator Analysis of preference ratings yielded six common factors which helped to account for 22.3 percent of the variance in preference response to the scene. Among these factors, the factor defined as 'bright with many plants' was the most preferred and the factor defined as 'simple and closed' was the least preferred. The environmental attributes reflected in six groups of scenes were colour, resting place, window and the six predictors. In the commercial building scenes, complexity, spaciousness, coherence, brightness and mystery out of six predictors accounted for 74 percent of preference variance as the significant contributors. In the business building scenes, three predictors which are brightness, complexity, spaciousness accounted for 84 percent of preference variance. 'The amount of plant' not only influenced the preference indirectly through the intervening variable, complexity, but also was moderately correlated with brightness. The overall pattern of the resulted confirmed the usefulness of the Informational Approach to predict the preference in interiors focusing on lobbies.

  • PDF

Modified Cubic Convolution Interpolation for Low Computational Complexity

  • Jun, Young-Hyun;Yun, Jong-Ho;Choi, Myung-Ryul
    • 한국정보디스플레이학회:학술대회논문집
    • /
    • 2006.08a
    • /
    • pp.1259-1262
    • /
    • 2006
  • In this paper, we propose a modified cubic convolution interpolation for the enlargement or reduction of digital images using a pixel difference value. The proposed method has a low complexity: the number of multiplier of weighted value to calculate one pixel of a scaled image has seven less than that of cubic convolution interpolation has sixteen. We use the linear function of the cubic convolution and the difference pixel value for selecting interpolation methods. The proposed method is compared with the conventional one for the computational complexity and the image quality. The simulation results show that the proposed method has less computational complexity than one of the cubic convolution interpolation.

  • PDF