The search functionality is under construction.

Keyword Search Result

[Keyword] state evolution(3hit)

1-3hit
  • Simplification and Accurate Implementation of State Evolution Recursion for Conjugate Gradient

    Sakyo HASHIMOTO  Keigo TAKEUCHI  

     
    LETTER-Communication Theory and Signals

      Pubricized:
    2022/12/15
      Vol:
    E106-A No:6
      Page(s):
    952-956

    This letter simplifies and analyze existing state evolution recursions for conjugate gradient. The proposed simplification reduces the complexity for solving the recursions from cubic order to square order in the total number of iterations. The simplified recursions are still catastrophically sensitive to numerical errors, so that arbitrary-precision arithmetic is used for accurate evaluation of the recursions.

  • On the Convergence of Convolutional Approximate Message-Passing for Gaussian Signaling Open Access

    Keigo TAKEUCHI  

     
    PAPER-Communication Theory and Signals

      Pubricized:
    2021/08/11
      Vol:
    E105-A No:2
      Page(s):
    100-108

    Convolutional approximate message-passing (CAMP) is an efficient algorithm to solve linear inverse problems. CAMP aims to realize advantages of both approximate message-passing (AMP) and orthogonal/vector AMP. CAMP uses the same low-complexity matched-filter as AMP. To realize the asymptotic Gaussianity of estimation errors for all right-orthogonally invariant matrices, as guaranteed in orthogonal/vector AMP, the Onsager correction in AMP is replaced with a convolution of all preceding messages. CAMP was proved to be asymptotically Bayes-optimal if a state-evolution (SE) recursion converges to a fixed-point (FP) and if the FP is unique. However, no proofs for the convergence were provided. This paper presents a theoretical analysis for the convergence of the SE recursion. Gaussian signaling is assumed to linearize the SE recursion. A condition for the convergence is derived via a necessary and sufficient condition for which the linearized SE recursion has a unique stationary solution. The SE recursion is numerically verified to converge toward the Bayes-optimal solution if and only if the condition is satisfied. CAMP is compared to conjugate gradient (CG) for Gaussian signaling in terms of the convergence properties. CAMP is inferior to CG for matrices with a large condition number while they are comparable to each other for a small condition number. These results imply that CAMP has room for improvement in terms of the convergence properties.

  • Finite-Size Correction of Expectation-Propagation Detection Open Access

    Yuki OBA  Keigo TAKEUCHI  

     
    LETTER-Communication Theory and Signals

      Pubricized:
    2021/07/19
      Vol:
    E105-A No:1
      Page(s):
    77-81

    Expectation propagation (EP) is a powerful algorithm for signal recovery in compressed sensing. This letter proposes correction of a variance message before denoising to improve the performance of EP in the high signal-to-noise ratio (SNR) regime for finite-sized systems. The variance massage is replaced by an observation-dependent consistent estimator of the mean-square error in estimation before denoising. Massive multiple-input multiple-output (MIMO) is considered to verify the effectiveness of the proposed correction. Numerical simulations show that the proposed variance correction improves the high SNR performance of EP for massive MIMO with a few hundred transmit and receive antennas.