Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Symposium on Information Theory (ISIT)

低密度パリティ検査符号の Bit Serial 型 Sum-Product 復号法

雅人 矢部, 吉広 栗原, 和彦 山口, 欣吾 小林

Published Dec 15, 2003• 0 citations
OpenAlex

Related papers

Studies on bit serial Sum-Product decoding based on controlling decoding order

Kazuhiko Yamaguchi

International Symposium on Information Theory and its Applications•Jan 1, 2004•3 citations

信頼度更新を用いたLDPC符号の Weighted Bit-Flipping 復号法

匡 佐藤, 剛 細谷, 秀樹 八木 +1 more

IEEE International Symposium on Information Theory (ISIT)•Nov 20, 2005•0 citations

Complexity-reducing Algorithm for Serial Min-sum Decoding

Hironori Uchikawa, Kohsuke Harada, Tanabe Yasuhiko

IEICE Technical Report; IEICE Tech. Rep.•Sep 4, 2008•0 citations

Performance Evaluation of a Combination of Sum-Product and Two-bit Bit Flipping Decoding Algorithms

Koh Matsushita, Hiroshi Kamabe

IEICE Technical Report; IEICE Tech. Rep.•Feb 28, 2013•0 citations

逐次更新型Min-sum復号法の演算量削減に関する一検討(LDPC符号セッション(復号法),LDPC符号,及び一般)

Hironori Uchikawa, 康祐 原田, 康彦 田邉

Information technology newsletter•Sep 4, 2008•0 citations

Serial Sum-Product Architecture for Low-Density Parity-Check Codes

Ruwan Ratnayake, Erich F. Haratsch, Gu-Yeon Wei

A serial sum-product architecture for low-density parity-check (LDPC) codes is presented. In the proposed architecture, a standard bit node processing unit computes the bit to check node messages sequentially, while the check node computations are broken up into several steps and computed on the fly. This bit node centric architecture requires considerably less memory compared to other serial architectures, including the check node centric architecture.

International Conference on Computer Communications and Networks (ICCCN)•Aug 1, 2007•1 citation