Search Results 1-20 of 41

  • 1 / 3
  • An acceleration method of sparse diffusion LMS based on message propagation  [in Japanese]

    中井 彩乃 , 林 和則

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 118(434), 1-6, 2019-01-31

  • An acceleration method of sparse diffusion LMS based on message propagation  [in Japanese]

    中井 彩乃 , 林 和則

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 118(433), 1-6, 2019-01-31

  • A Hybrid CRBP-VMP Cooperative Positioning Algorithm for Distributed Multi-UAVs

    LU Lu , LI Guangxia , LIU Tianwei , LI Siming , TIAN Shiwei

    … In this paper, we present a factor graph (FG) representation and message passing methodology to solve cooperative positioning problem among UAVs in 3-dimensional environment where GNSS cannot provide services. …

    IEICE Transactions on Communications E102.B(10), 1933-1940, 2019

    J-STAGE 

  • Distributed Approximate Message Passing Algorithm Using Summation Propagation  [in Japanese]

    早川 諒 , 中井 彩乃 , 林 和則

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 117(396), 113-117, 2018-01-22

  • Distributed Approximate Message Passing Algorithm Using Summation Propagation  [in Japanese]

    早川 諒 , 中井 彩乃 , 林 和則

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 117(395), 113-117, 2018-01-22

  • Distributed Approximate Message Passing Algorithm Using Summation Propagation  [in Japanese]

    早川 諒 , 中井 彩乃 , 林 和則

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 117(394), 113-117, 2018-01-22

  • Low-PAPR Approximate Message Passing Precoding Algorithm in Massive MIMO Systems

    MENG Meimei , LI Xiaohui , LIU Yulong , HEI Yongqiang

    … Then, in order to obtain the optimal solution with low complexity, the precoding problem is recast into a Bayesian estimation problem by leveraging belief propagation algorithm. … Eventually, we propose a low-PAPR approximate message passing (LP-AMP) algorithm based on belief propagation to ensure the good transmission performance and minimize the PAPR to realize practical deployments. …

    IEICE Transactions on Communications E101.B(4), 1102-1107, 2018

    J-STAGE 

  • A study of message propagation algorithms for approximate MAP inference of large scale probabilistic models  [in Japanese]

    佐野 崇 , 一杉 裕志

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 116(300), 81-86, 2016-11-16

  • Low-Complexity Exploration in Utility Hypergraphs

    Hadfi Rafik , Ito Takayuki

    … Exploring the utility space is therefore reduced to a message passing mechanism along the hyperedges by means of utility propagation. … The optimal contracts are efficiently found using a variation of the Max-Sum algorithm. … Exploring the utility space is therefore reduced to a message passing mechanism along the hyperedges by means of utility propagation. …

    Journal of information processing 23(2), 176-184, 2015-03-15

    IPSJ  J-STAGE 

  • Low-Complexity Exploration in Utility Hypergraphs

    Rafik Hadfi , Takayuki Ito

    … Exploring the utility space is therefore reduced to a message passing mechanism along the hyperedges by means of utility propagation. … The optimal contracts are efficiently found using a variation of the Max-Sum algorithm. … Exploring the utility space is therefore reduced to a message passing mechanism along the hyperedges by means of utility propagation. …

    IPSJ Journal 56(3), 2015-03-15

    IPSJ 

  • A vehicle clustering algorithm for information propagation by inter-vehicle communications

    Washio Naohiro , Matsuura Satoshi , Kakiuchi Masatoshi , Inomata Atsuo , Fujikawa Kazutoshi

    … There are some cases regarding information propagation over a wide area, such as Vehicle-to-Vehicle (V2V) communications, in which an end-to-end path does not exist, due to the non-uniform density of vehicles. … In order to solve this problem, Delay Tolerant Network (DTN) architectures have been studied to facilitate message delivery in V2V communications. …

    2015-03

    IR 

  • Complex Multi-Issue Negotiation Using Utility Hyper-Graphs

    Hadfi Rafik , Ito Takayuki

    … Exploring the utility space reduces then to a message passing mechanism along the hyper-edges of the hyper-graph by means of utility propagation. … Optimal contracts are found efficiently using a variation of the Max-Sum algorithm. …

    Journal of Advanced Computational Intelligence and Intelligent Informatics 19(4), 514-522, 2015

    J-STAGE 

  • A Vehicle Clustering Algorithm for Information Propagation by Inter-Vehicle Communications  [in Japanese]

    WASHIO Naohiro , MATSUURA Satoshi , KAKIUCHI Masatoshi , INOMATA Atsuo , FUJIKAWA Kazutoshi

    車車間通信を利用して広域での情報伝播を行う場合,車両密度が不均一であるためにエンドツーエンドの通信経路が存在しない場合がある.このような環境における車車間でのメッセージ配送方式にDelay Tolerant Network(DTN)を利用する事が考えられる.しかしながら,既存のDTNルーティング手法では対向車両とのすれ違い時のメッセージ転送効率を考慮しておらず,結果として伝播効率の低下に伴う情報損 …

    IEICE technical report. Internet Architecture 114(374), 19-24, 2014-12-18

  • Efficient Method for Computing Belief Propagation, with Application to CDMA Multiuser Detection

    KURIYA Arise , TANAKA Toshiyuki

    Pearlが提案した確率伝搬法(BP)はグラフィカルモデルに対する確率推論を行うためのアルゴリズムである。BPは一般に、グラフのノードの次数に関して指数時間で計算量が増えるので、密なグラフで表現された問題への適用は難しい。CDMAマルチユーザ検出においては、BPを適用する際に生じる計算困難を回避するために近似手法が導入された。この近似手法は、圧縮センシングに対する近似メッセージ伝搬法(AMP)と本 …

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 114(306), 149-153, 2014-11-17

  • Application of partial parallel interference cancellation to sparse signal recovery  [in Japanese]

    TAKEDA Koujin , TANAKA Toshiyuki

    CDMA復調問題で提案された部分並列干渉除去法を圧縮センシングにおける疎信号復元問題に応用し,収束性が良くかつ計算量が少ない疎信号復元アルゴリズムを構築する方法を議論する.また復元実験の結果を示しその性能及び問題点について述べる.加えて確率伝搬法に基づいたアルゴリズムである近似的確率伝搬法(AMP)との関係を調べる.

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 114(306), 1-7, 2014-11-17

  • Dynamic Check Message Majority-Logic Decoding Algorithm for Non-binary LDPC Codes

    LU Yichao , PENG Xiao , TIAN Guifen , GOTO Satoshi

    … However, compared with conventional belief propagation algorithms, majority-logic algorithms suffer from severe bit error performance degradation. … This paper presents a low-complexity reliability-based algorithm aiming at improving error correcting ability of majority-logic algorithms. …

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E97.A(6), 1356-1364, 2014

    J-STAGE 

  • Message Passing Decoder with Decoding on Zigzag Cycles for Non-binary LDPC Codes

    NOZAKI Takayuki , KASAI Kenta , SAKANIWA Kohichi

    … In this paper, we propose a message passing decoding algorithm which lowers decoding error rates in the error floor regions for non-binary low-density parity-check (LDPC) codes transmitted over the binary erasure channel (BEC) and the memoryless binary-input output-symmetric (MBIOS) channels. …

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E97.A(4), 975-984, 2014

    IR  J-STAGE 

  • Performance Evaluation of Belief-Propagation Algorithm with MRC for Signal Detection in a Large Scale MIMO System  [in Japanese]

    ABIKO Takashi , FUKUDA Wataru , NISHIMURA Toshihiko , OHGANE Takeo , OGAWA Yasutaka , OHWATARI Yusuke , KISHIYAMA Yoshihisa

    近年の無線通信システムで用いられている伝送速度向上のための手法として,MIMO(multlpie-inputmultiple-output)システムがある.このMIMOシステムの素子数を100素子規模に拡大する検討が現在行われている.しかし,一般の信号検出手法では,最小でも素子数の3乗オーダーの処理が必要になるため,処理負荷を減少させる必要がある.筆者らはこれまで,並列干渉キャンセラを用いた確率伝 …

    Technical report of IEICE. RCS 112(424), 231-236, 2013-01-31

  • Performance Evaluation of Belief-Propagation Algorithm with MRC for Signal Detection in a Large Scale MIMO System  [in Japanese]

    ABIKO Takashi , FUKUDA Wataru , NISHIMURA Toshihiko , OHGANE Takeo , OGAWA Yasutaka , OHWATARI Yusuke , KISHIYAMA Yoshihisa

    近年の無線通信システムで用いられている伝送速度向上のための手法として,MIMO(multlpie-inputmultiple-output)システムがある.このMIMOシステムの素子数を100素子規模に拡大する検討が現在行われている.しかし,一般の信号検出手法では,最小でも素子数の3乗オーダーの処理が必要になるため,処理負荷を減少させる必要がある.筆者らはこれまで,並列干渉キャンセラを用いた確率伝 …

    IEICE technical report. Signal processing 112(423), 231-236, 2013-01-31

  • Hybrid Message-Passing Algorithm and Architecture for Decoding Cyclic Non-binary LDPC Codes

    LU Yichao , HE Gang , TIAN Guifen , GOTO Satoshi

    … This paper proposes a hybrid message-passing decoding algorithm which consumes very low computational complexity. … It achieves competitive error performance compared with conventional Min-max algorithm. … Simulation result on a (255,174) cyclic code shows that this algorithm obtains at least 0.5dB coding gain over other state-of-the-art low-complexity NB-LDPC decoding algorithms. …

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E96.A(12), 2652-2659, 2013

    J-STAGE 

  • 1 / 3
Page Top