咨询与建议

限定检索结果

文献类型

  • 64 篇 期刊文献
  • 42 篇 会议

馆藏范围

  • 106 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 102 篇 工学
    • 74 篇 电气工程
    • 49 篇 计算机科学与技术...
    • 42 篇 信息与通信工程
    • 11 篇 电子科学与技术(可...
    • 8 篇 控制科学与工程
    • 4 篇 交通运输工程
    • 3 篇 网络空间安全
    • 2 篇 机械工程
    • 2 篇 软件工程
    • 1 篇 仪器科学与技术
  • 23 篇 理学
    • 20 篇 数学
    • 2 篇 物理学
  • 4 篇 管理学
    • 4 篇 管理科学与工程(可...
  • 2 篇 军事学
    • 2 篇 军队指挥学
  • 1 篇 法学
    • 1 篇 法学
  • 1 篇 医学
    • 1 篇 临床医学

主题

  • 106 篇 tanner graph
  • 28 篇 girth
  • 23 篇 ldpc codes
  • 13 篇 parity check cod...
  • 10 篇 iterative decodi...
  • 10 篇 graph theory
  • 9 篇 low-density pari...
  • 8 篇 decoding
  • 8 篇 ldpc code
  • 6 篇 belief propagati...
  • 6 篇 low-density pari...
  • 5 篇 qc-ldpc codes
  • 5 篇 minimum distance
  • 4 篇 ldpc
  • 4 篇 protograph
  • 4 篇 trapping sets
  • 4 篇 matrix algebra
  • 3 篇 parity-check mat...
  • 3 篇 low-density pari...
  • 3 篇 bipartite graph

机构

  • 4 篇 carleton univ sc...
  • 3 篇 amirkabir univ t...
  • 3 篇 carleton univ sc...
  • 3 篇 univ calif davis...
  • 3 篇 univ notre dame ...
  • 2 篇 st petersburg un...
  • 2 篇 isfahan math hou...
  • 2 篇 politecn milan d...
  • 2 篇 new mexico state...
  • 2 篇 univ notre dame ...
  • 2 篇 amirkabir univ t...
  • 2 篇 univ arizona dep...
  • 2 篇 skolkovo inst sc...
  • 2 篇 sogang univ dept...
  • 2 篇 san diego state ...
  • 2 篇 utkin ryazan sta...
  • 2 篇 cnr ist elettron...
  • 2 篇 zhoukou normal u...
  • 1 篇 pontifical catho...
  • 1 篇 jsc russian spac...

作者

  • 11 篇 sadeghi mohammad...
  • 10 篇 amirzade farzane
  • 9 篇 panario daniel
  • 6 篇 gholami mohammad
  • 5 篇 smarandache roxa...
  • 3 篇 mitchell david g...
  • 3 篇 bellini sandro
  • 3 篇 ferrari marco
  • 3 篇 tomasoni alessan...
  • 3 篇 abdel-ghaffar kh...
  • 3 篇 lin shu
  • 2 篇 kim seong-woon
  • 2 篇 johannesson rolf
  • 2 篇 sason i
  • 2 篇 patil siddarama ...
  • 2 篇 samadieh mehdi
  • 2 篇 vontobel pascal ...
  • 2 篇 hwang sun-young
  • 2 篇 vasic bane
  • 2 篇 rosnes eirik

语言

  • 105 篇 英文
  • 1 篇 其他
检索条件"主题词=Tanner Graph"
106 条 记 录,以下是1-10 订阅
排序:
Belief Propagation Decoding for Short-Length Codes Based on Sparse tanner graph
收藏 引用
IEEE COMMUNICATIONS LETTERS 2024年 第5期28卷 969-973页
作者: Li, Zongyao Shen, Yifei Ren, Yuqing Huang, Yongming You, Xiaohu Zhang, Chuan Southeast Univ Natl Mobile Commun Res Lab LEADS Nanjing 211189 Peoples R China Southeast Univ Frontiers Sci Ctr Mobile Informat Commun & Secur Nanjing 211189 Peoples R China Purple Mt Labs Nanjing 211100 Peoples R China Ecole Polytech Fed Lausanne EPFL Telecommun Circuits Lab TCL CH-1015 Lausanne Switzerland
In this letter, we present a novel approach to improve belief propagation (BP) decoding performance by sparsifying the tanner graph. Our proposed method first constructs a low-weight parity-check (LWPC) matrix with in... 详细信息
来源: 评论
An Efficient Strategy to Count Cycles in the tanner graph of Quasi-Cyclic LDPC Codes
IEEE JOURNAL ON SELECTED AREAS IN INFORMATION THEORY
收藏 引用
IEEE JOURNAL ON SELECTED AREAS IN INFORMATION THEORY 2023年 4卷 499-513页
作者: Gomez-Fonseca, Anthony Smarandache, Roxana Mitchell, David G. M. Univ Notre Dame Dept Math Notre Dame IN 46556 USA Univ Notre Dame Dept Elect Engn Notre Dame IN 46556 USA New Mexico State Univ Klipsch Sch Elect & Comp Engn Las Cruces NM 88003 USA
In this paper, we present an efficient strategy to enumerate the number of k-cycles, g = 0. We provide formulas for the number of k-cycles, N-k, by just taking into account repetitions in some multisets constructed fr... 详细信息
来源: 评论
Low-loss belief propagation decoder with tanner graph in quantum error-correction codes
收藏 引用
Chinese Physics B 2022年 第1期31卷 143-149页
作者: Dan-Dan Yan Xing-Kui Fan Zhen-Yu Chen Hong-Yang Ma School of Sciences Qingdao University of TechnologyQingdao 266033China
Quantum error-correction codes are immeasurable resources for quantum computing and quantum ***,the existing decoders are generally incapable of checking node duplication of belief propagation(BP)on quantum low-densit... 详细信息
来源: 评论
Detecting Cycles of Length 8 in the tanner graph of a QC-LDPC Code Based on Protograph Analysis
收藏 引用
PROBLEMS OF INFORMATION TRANSMISSION 2020年 第2期56卷 173-184页
作者: Kharin, A., V Zavertkin, K. N. Ovinnikov, A. A. Utkin Ryazan State Radio Engn Univ Fac Radio Engn & Telecommun Dept Theoret Fdn Elect Engn Ryazan Russia
For cycles of length 8 in a tanner graph, we propose an identification procedure based on the analysis of paths in a protograph. We formulate and prove a number of theorems that introduce identification rules for cycl... 详细信息
来源: 评论
Detecting Cycles of Length 10 in the tanner graph of a QC-LDPC Code Based on Protograph Analysis
收藏 引用
PROBLEMS OF INFORMATION TRANSMISSION 2020年 第4期56卷 317-331页
作者: Kharin, A. V. Zavertkin, K. N. Ovinnikov, A. A. Utkin Ryazan State Radio Engn Univ Fac Radio Engn & Telecommun Dept Theoret Fdn Elect Engn Ryazan Russia
We complete the description of the procedure of topological expansion of a bipartite graph without parallel branches on the plane of changing the structure of cycles of length up to 10 inclusive. Based on previous pap... 详细信息
来源: 评论
On the performance of tanner graph based and Viterbi Decoding for Erasure Recovery  82
On the performance of Tanner Graph based and Viterbi Decodin...
收藏 引用
IEEE 82nd Vehicular Technology Conference (VTC Fall)
作者: Azeem, Muhammad Moazam Khan, Abdul Baqi Azeem, Uzma Univ Paris 06 Univ Sorbonne UMR 7606 LIP6 F-75005 Paris France Jubail Univ Coll Jubail Ind City 31961 Saudi Arabia Yanbu Univ Coll Yanbu Ind City 31387 Saudi Arabia
We address the utilization of short erasure correcting codes to recover the erased data in opportunistic spectrum access (OSA) due to collisions among multiple users. The main application of using short codes over lon... 详细信息
来源: 评论
A Unifying Framework to Construct QC-LDPC tanner graphs of Desired Girth
收藏 引用
IEEE TRANSACTIONS ON INFORMATION THEORY 2022年 第9期68卷 5802-5822页
作者: Smarandache, Roxana Mitchell, David G. M. Univ Notre Dame Dept Math & Elect Engn Notre Dame IN 46556 USA New Mexico State Univ Klipsch Sch Elect & Comp Engn Las Cruces NM 88003 USA
This paper presents a unifying framework to construct low-density parity-check (LDPC) codes with associated tanner graphs of desired girth. Towards this goal, we highlight the role that a certain square matrix that ap... 详细信息
来源: 评论
Doped low-density parity-check codes
收藏 引用
Digital Communications and Networks 2024年 第1期10卷 217-226页
作者: Yong Li Rui Liu Xianlong Jiao Youqiang Hu Zhen Luo Francis C.M.Lau College of Computer Science Chongqing UniversityChongqing400044China School of Automation Chongqing UniversityChongqing400044China College of Electronic and Information Engineering Southwest UniversityChongqing400715China Future Wireless Networks and IoT Focusing Area Department of Electronic and Information EngineeringHong Kong Polytechnic UniversityHong KongChina
In this paper,we propose a doping approach to lower the error floor of Low-Density Parity-Check(LDPC)*** doping component is a short block code in which the information bits are selected from the coded bits of the dom... 详细信息
来源: 评论
Construction of Protograph-Based LDPC Codes With Chordless Short Cycles
收藏 引用
IEEE TRANSACTIONS ON INFORMATION THEORY 2024年 第1期70卷 51-74页
作者: Amirzade, Farzane Sadeghi, Mohammad-Reza Panario, Daniel Amirkabir Univ Technol Dept Math & Comp Sci Tehran Polytech Tehran *** Iran Carleton Univ Sch Math & Stat Ottawa ON K1S 5B6 Canada
There is a concept in graph theory known as a chord which has not been considered before in relation to trapping sets of tanner graphs. A chord of a cycle is an edge outside the cycle which connects two vertices of th... 详细信息
来源: 评论
Girth Analysis of Quantum Quasi-Cyclic LDPC Codes
收藏 引用
PROBLEMS OF INFORMATION TRANSMISSION 2024年 第2期60卷 71-89页
作者: Amirzade, Farzane Panario, Daniel Sadeghi, Mohammad-Reza Carleton Univ Sch Math & Stat Ottawa ON Canada Amirkabir Univ Technol Dept Math & Comp Sci Tehran Polytech Tehran Iran
Quantum quasi-cyclic LDPC (QQC LDPC) codes, as CSS (Calderbank, Shor, and Steane) codes, are attracting attention because of their good structure and popular channel coding schemes. Fully connected quasi-cyclic LDPC (... 详细信息
来源: 评论