computational complexity


Also found in: Acronyms, Encyclopedia, Wikipedia.

computational complexity

n.
The quantification of the difficulty of a computational problem in terms of the computer resources (such as computational time or amount of memory) required for its solution.
American Heritage® Dictionary of the English Language, Fifth Edition. Copyright © 2016 by Houghton Mifflin Harcourt Publishing Company. Published by Houghton Mifflin Harcourt Publishing Company. All rights reserved.
Mentioned in ?
References in periodicals archive ?
In this section, we analyse the computational complexity of AST-SLM, SLM, ACE and PTS.
In this section, we propose the SU and MU precoding algorithms and analyze their computational complexity. The calculation of the hybrid precoding is divided into analogue and digital steps.
Compared with the ML detector, the MML detector can achieve a lower computational complexity. In [20], a low-complexity symbol detection based on modified beam search (MBS) was proposed.
The computational complexity of the algorithm is mainly dependent on the initialization and iteration.
Finally, the real value-based ESPRIT is carried out for estimating DOA with further reduced computational complexity. The proposed method is quite different from the beamspace ESPRIT method [20], in which only spatial information is utilized for DOA estimation.
In addition, in this way, we can reduce computational complexity. In order to remove the influence of brightness, we convert these selected smooth blocks from RGB color space to HSV color space to get new ones [B.sub.hsv].
Keywords: LTE Turbo Codes, Max-Log-MAP Turbo Decoding, Computational Complexity Analysis.
As the core of traditional image coding, the fast DCT transformation bears computational complexity O(N [log.sub.2] N).
Likewise, the authors in [9] derive a low complexity algorithm for Hermitian positive-definite recursive matrix inversion that provides low computational complexity compared to [7, 8] with the utilization of 52 operations for finding matrix inversion only.
When the CFO is uncertain, the optimum joint ML estimation of ([tau], [epsilon]), given in (23), needs to be obtained by numerical method, requiring high computational complexity because of the continuous variable [epsilon].
Meanwhile, the CCM estimation and its inversion are required in the processing of GIP, which lead to the heavy computational complexity of STAP and go against efficient target detection.

Full browser ?