Topic
Average-case complexity
About: Average-case complexity is a research topic. Over the lifetime, 1749 publications have been published within this topic receiving 44972 citations.
Papers published on a yearly basis
Papers
More filters
01 Sep 2007
3 citations
01 Jan 2004
TL;DR: An original way to restore the last values of AC-6 and AC-7 algorithms in order to obtain a MAC version of these algorithms whose space complexity remains in O(ed) while keeping the O(e) time complexity on any branch of the tree search.
Abstract: In this paper, we present in detail the versions of the arc consistency algorithms for binary constraints based on list of supports and last value when they are maintained during the search for solutions. In other words, we give the explicit codes of MAC-6 and MAC-7 algorithms. Moreover, we present an original way to restore the last values of AC-6 and AC-7 algorithms in order to obtain a MAC version of these algorithms whose space complexity remains in O(ed) while keeping the O(ed) time complexity on any branch of the tree search. This result outperforms all previous studies.
3 citations
•
3 citations
••
TL;DR: This paper proposes an improved PASD (I-PASD) algorithm that can alleviate the memory requirement and further reduce the decoding complexity and confirms that the complexity and memory reductions are realised with preserving the error-correction capability of the ASD algorithm.
3 citations
•
14 Jun 2010TL;DR: Simulation results show that the two proposed algorithms can achieve near optimal performance in two separate and distinctive SNR regions and it is demonstrated by analysis how these methods can greatly simplify the computational complexity of the GPA algorithm.
Abstract: Discrete bit loading for multicarrier systems based on the greedy power allocation (GPA) algorithm is considered in this paper. A new suboptimal scheme that independently performs GPA on groups of subcarriers and therefore can significantly reduce complexity compared to the standard GPA is proposed. These groups are formed in an initial step of a uniform power allocation (UPA) algorithm. In order to more efficiently allocate the available transmit power, two power re-distribution algorithms are further introduced by including a transfer of residual power between groups. Simulation results show that the two proposed algorithms can achieve near optimal performance in two separate and distinctive SNR regions. We demonstrate by analysis how these methods can greatly simplify the computational complexity of the GPA algorithm.
3 citations