Search Results 1-20 of 37

  • 1 / 2
  • Fast Converging ADMM Penalized Decoding Method Based on Improved Penalty Function for LDPC Codes

    WANG Biao

    … <p>For low-density parity-check (LDPC) codes, the penalized decoding method based on the alternating direction method of multipliers (ADMM) can improve the decoding performance at low signal-to-noise ratios and also has low decoding complexity. …

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2020

    J-STAGE 

  • A Fast Iterative Check Polytope Projection Algorithm for ADMM Decoding of LDPC Codes by Bisection Method

    LIN Yan , XIA Qiaoqiao , HE Wenwu , ZHANG Qinglin

    … <p>Using linear programming (LP) decoding based on alternating direction method of multipliers (ADMM) for low-density parity-check (LDPC) codes shows lower complexity than the original LP decoding. … However, the development of the ADMM-LP decoding algorithm could still be limited by the computational complexity of Euclidean projections onto parity check polytope. …

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E102.A(10), 1406-1410, 2019

    J-STAGE 

  • On the Separating Redundancy of the Duals of First-Order Generalized Reed-Muller Codes

    LIU Haiyang , LI Yan , MA Lianrong

    … <p>The separating redundancy is an important property in the analysis of the error-and-erasure decoding of a linear block code. … In this work, we investigate the separating redundancy of the duals of first-order generalized Reed-Muller (GRM) codes, a class of nonbinary linear block codes that have nice algebraic properties. …

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E102.A(1), 310-315, 2019

    J-STAGE 

  • Linear Programming Decoding of Binary Linear Codes for Symbol-Pair Read Channel

    HORII Shunsuke , MATSUSHIMA Toshiyasu , HIRASAWA Shigeichi

    … <p>In this study, we develop a new algorithm for decoding binary linear codes for symbol-pair read channels. … The proposed decoding algorithm is based on linear programming (LP). …

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E99.A(12), 2170-2178, 2016

    J-STAGE 

  • Suppressing Fractional Pseudocodewords by Eliminating Small Instantons

    GUO Junjun , MU Jianjun , JIAO Xiaopeng , ZHAO Peng

    … In this letter, a new method is presented to suppress fractional pseudocodewords by eliminating small instantons of irregular low-density parity-check (LDPC) codes under the linear programming (LP) decoding over the binary symmetric channel (BSC). … By appending several new rows found by the integer linear programming formulation to the original parity-check matrix, the optimal distribution spectrum of BSC-instantons in the modified code is obtained. …

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E99.A(2), 674-677, 2016

    J-STAGE 

  • Linear Programming Decoding of Binary Linear Codes over Symbol-Pair Read Channels  [in Japanese]

    堀井 俊佑 , 松嶋 敏泰 , 平澤 茂一

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 115(214), 1-6, 2015-09-04

  • COMBINING FINITE-STATE BIT-FLIPPING WITH ADMM-BASED LINEAR PROGRAMMING DECODING FOR LDPC Codes

    WU DAIWEN , GUO JUNJUN

    ICIC express letters. Part B, Applications : an international journal of research and surveys 6(6), 1697-1702, 2015-06

  • Finding Small Fundamental Instantons of LDPC Codes by Path Extension

    GUO Junjun , MU Jianjun , JIAO Xiaopeng , LI Guiping

    … In this letter, we present a new scheme to find small fundamental instantons (SFIs) of regular low-density parity-check (LDPC) codes for the linear programming (LP) decoding over the binary symmetric channel (BSC). … Then we identify actual instantons from potential ones under the LP decoding. …

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

    J-STAGE 

  • Simultaneous Wireless Information and Energy Transfer for MIMO Relay Channel with Antenna Switching

    KRIKIDIS Ioatnnis , SASAKI Shigenobu , TIMOTHEOU Stelios

    … The proposed technique exploits the array configuration at the relay node and uses the antenna elements either for conventional decoding or for rectifying (rectennas). … In order to keep the complexity low, a dynamic antenna switching between decoding/rectifying is proposed based on the principles of the generalized selection combiner (GSC); … the strongest paths are allocated for decoding while the remaining channel paths for rectifying (and vice versa). …

    IEICE technical report. WBS, Wideband System 113(275), 13-18, 2013-10-31

  • Iterative Multiuser Joint Decoding based on Augmented Lagrangian Method

    HORII Shunsuke , SUKO Tota , MATSUSHIMA Toshiyasu , HIRASAWA Shigeichi

    … In this paper, we develop an iterative multiuser joint decoding of code-division multiple-access (CDMA) signals based on a distributed optimization algorithm. … For the joint decoding problem, decoding algorithm based on the turbo principle is widely used. … On the other hand, in the research area of error correcting codes, the decoding algorithm based on convex optimization has been attracting a great deal of attention. …

    IEICE technical report. Information theory 113(228), 13-17, 2013-09-27

  • Multi-Document Summarization Model Based on Redundancy-Constrained Knapsack Problem  [in Japanese]

    NISHIKAWA Hitoshi , HIRAO Tsutomu , MAKINO Toshiro , MATSUO Yoshihiro , MATSUMOTO Yuji

    … As the redundancy-constrained knapsack problem is an NP-hard problem and its computational cost is high, we propose a fast decoding method based on the Lagrange heuristic to quickly locate an approximate solution. … We also show that our decoding method finds a good approximate solution, which is comparable to the optimal solution of the maximum coverage model, more than 100 times faster than an integer linear programming solver. …

    Journal of Natural Language Processing 20(4), 585-612, 2013-09-13

    J-STAGE  References (29)

  • A-6-12 On ARQ scheme using Linear Programming decoding with Branch-and-Cut Approach  [in Japanese]

    Kawaji Yuya , Niinomi Toshihiro , Kuwako Masashi , Yoshino Kunio

    Proceedings of the IEICE General Conference 2013年_基礎・境界, 134, 2013-03-05

  • Linear Programming Decoding for Multiple Access Channel based on Decomposition Methods (情報理論)

    堀井 俊佑 , 松嶋 敏泰

    電子情報通信学会技術研究報告 : 信学技報 112(215), 53-58, 2012-09-27

  • Linear Programming Decoding for Multiple Access Channel based on Decomposition Methods  [in Japanese]

    HORII Shunsuke , MATSUSHIMA Toshiyasu

    … In this paper, we develop a dual decomposition method based linear-programming (LP) decoding for multiple-access channels with binary linear codes. …

    IEICE technical report. Information theory 112(215), 53-58, 2012-09-20

  • A Note on the Linear Programming Decoding of Binary Linear Codes for Multiple-Access Channel

    HORII Shunsuke , MATSUSHIMA Toshiyasu , HIRASAWA Shigeichi

    … In this paper, we develop linear-programming (LP) decoding for multiple-access channels with binary linear codes. … For single-user channels, LP decoding has attracted much attention in recent years as a good approximation to maximum-likelihood (ML) decoding. …

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 94(6), 1230-1237, 2011-06-01

    J-STAGE  References (14)

  • A Note on the Inference Algorithm on the Factor Graph based on the Linear Programming  [in Japanese]

    HORII Shunsuke , MATSUSHIMA Toshiyasu , HIRASAWA Shigeichi

    … Recently, linear programming based decoding algorithm for the error-correcting code has been receiving a lot of attention. … Viewing the decoding problem as an example of the probabilistic inference problem on the graphical model, the factor graph corresponds to the problem has some specific structure. … For the graph corresponds to the decoding problem, each non-indicator function is connected to only one variable node. …

    IEICE technical report 110(363), 55-60, 2011-01-11

    References (6)

  • Linearly Constrained Permutations

    WADAYAMA Tadashi

    … Making use of linear constraints imposed on the permutation matrices, we can formulate a soft-decoding problem for the proposed class of permutation codes as a linear programming (LP) problem. … An efficient LP solver based on simplex methods or interior point methods can be employed for this LP decoding. …

    IEICE technical report 110(363), 49-54, 2011-01-11

    References (16)

  • A Note on the Branch-and-Cut Approach to Decoding Linear Block Codes

    HORII Shunsuke , MATSUSHIMA Toshiyasu , HIRASAWA Shigeichi

    … Maximum likelihood (ML) decoding of linear block codes can be considered as an integer linear programming (ILP). … One of the most popular algorithms is linear programming (LP) decoding proposed by Feldman et al. …

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 93(11), 1912-1917, 2010-11-01

    J-STAGE  References (12)

  • An Improvement of Adaptive Cutting Plane Method for Linear Programming Decoding of Binary Linear Codes  [in Japanese]

    MURAMATSU Jun

    … An maximum-likelihood decoding algorithm for a linear code is introduced. … It is based on the linear programming method introduced by Feldman et al. …

    IEICE technical report. Information theory 110(205), 37-42, 2010-09-14

    References (7)

  • Linear Programming Decoding of Binary Linear Codes for Multiple-Access Channel

    HORII Shunsuke , MATSUSHIMA Toshiyasu , HIRASAWA Shigeichi

    … In this paper, we develop a linear-programming (LP) decoding for the multiple-access channel with binary linear codes. … For the single-user channel, LP decoding has been attracting much attention in recent years as a good approximation to the maximum likelihood decoding. …

    IEICE technical report. Information theory 110(205), 31-36, 2010-09-14

    References (11)

  • 1 / 2
Page Top