2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC)最新文献

筛选
英文 中文
Low-Latency LDPC Decoding Achieved by Code and Architecture Co-Design 代码与架构协同设计实现低延迟LDPC译码
Elsa Dupraz, François Leduc-Primeau, F. Gagnon
{"title":"Low-Latency LDPC Decoding Achieved by Code and Architecture Co-Design","authors":"Elsa Dupraz, François Leduc-Primeau, F. Gagnon","doi":"10.1109/ISTC.2018.8625276","DOIUrl":"https://doi.org/10.1109/ISTC.2018.8625276","url":null,"abstract":"A novel low-density parity-check decoder architecture is presented that can achieve a high data throughput while retaining the flexibility to decode a wide range of quasi-cyclic codes. The proposed architecture allows to combine multiple message-update schedules, providing an additional degree of freedom to jointly optimize the code and decoder architecture. Protograph-based code constructions are introduced that exploit this added degree of freedom in order to maximize data throughput, and that are also optimized to reduce the complexity of the required parallel data accesses. For some examples and under an ideal pipeline speedup assumption, the proposed architecture and code designs reduce decoding latency by a factor of 3.2× compared to a decoder using a strict sequential schedule.","PeriodicalId":441111,"journal":{"name":"2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133837894","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Algebraic Polar Lattices for Fast Fading Channels 快速衰落信道的代数极格
Ling Liu, Cong Ling
{"title":"Algebraic Polar Lattices for Fast Fading Channels","authors":"Ling Liu, Cong Ling","doi":"10.1109/ISTC.2018.8625282","DOIUrl":"https://doi.org/10.1109/ISTC.2018.8625282","url":null,"abstract":"Polar lattices have been recently proposed to achieve the egodic capacity of i.i.d. fading channels. In this paper, we further improve the performance of polar lattices by using algebraic tools while keeping quasilinear encoding and decoding complexity. We focus on the design of polar lattices in the case of unlimited transmission power. The lattice Gaussian shaping technique can be applied to satisfy the power constraint.","PeriodicalId":441111,"journal":{"name":"2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC)","volume":"359 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124522586","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
ISTC 2018 Programme Overview ISTC 2018计划概述
{"title":"ISTC 2018 Programme Overview","authors":"","doi":"10.1109/istc.2018.8625336","DOIUrl":"https://doi.org/10.1109/istc.2018.8625336","url":null,"abstract":"","PeriodicalId":441111,"journal":{"name":"2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128326857","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Graph-Based Message Passing Approach for Joint Source-Channel Coding via Information Bottleneck Principle 基于信息瓶颈原理的信源信道联合编码的图传递方法
Shayan Hassanpour, D. Wübben, A. Dekorsy
{"title":"A Graph-Based Message Passing Approach for Joint Source-Channel Coding via Information Bottleneck Principle","authors":"Shayan Hassanpour, D. Wübben, A. Dekorsy","doi":"10.1109/ISTC.2018.8625338","DOIUrl":"https://doi.org/10.1109/ISTC.2018.8625338","url":null,"abstract":"In this paper, we focus on an extended version of noisy source coding wherein the compressed data shall be transmitted over an imperfect (forward) channel for further processing. As the quantization design framework, we deploy the Information Bottleneck principle and propose a novel treatment by successful exploitation of a quite generic and highly flexible graph-based clustering routine known as Affinity Propagation. We also provide simulation results regarding a typical digital transmission setup to compare the performance of our proposed treatment with a state-of-the-art routine from literature.","PeriodicalId":441111,"journal":{"name":"2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130547951","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
ISTC 2018 Cover Page ISTC 2018封面
{"title":"ISTC 2018 Cover Page","authors":"","doi":"10.1109/istc.2018.8625298","DOIUrl":"https://doi.org/10.1109/istc.2018.8625298","url":null,"abstract":"","PeriodicalId":441111,"journal":{"name":"2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131155480","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A 100 Gbps LDPC Decoder for the IEEE 802.11ay Standard IEEE 802.11ay标准的100gbps LDPC解码器
Meng Li, V. Derudder, C. Desset, A. Dewilde, A. Bourdoux, Yanxiang Huang
{"title":"A 100 Gbps LDPC Decoder for the IEEE 802.11ay Standard","authors":"Meng Li, V. Derudder, C. Desset, A. Dewilde, A. Bourdoux, Yanxiang Huang","doi":"10.1109/ISTC.2018.8625286","DOIUrl":"https://doi.org/10.1109/ISTC.2018.8625286","url":null,"abstract":"IEEE 802.11ay is the amendment to the 802.11 standard that enables Wi-Fi devices to achieve 100 Gbps using the unlicensed mm-Wave (60 GHz) band at comparable ranges to today’s commercial 60 GHz devices based on the 802.11ad standard. In this paper, we propose a full row-based layered LDPC decoder supporting all the coding rates for 802.11ay. Taking the property of the parity check matrix of 802.11ay, combining multiple layers into single layer improves the hardware utilization hence increases the throughput. The throughput is further increases by interleaving multiple frames to improve the utilization of each pipeline stage. The decoder is synthesized at both 28 nm and 16 nm CMOS technology and power estimated with stimuli at 7db and 3.5db. The 28 nm implementation running at 600 MHz and achieves a throughput of 67 Gbps for coding rate 13/16 at 4 iterations with area efficiency of 160 Gbps/sqmm and consumes an average power consumption of 408 mW and 141 mW, yielding energy efficiency of 6.05 pJ/bit and 2.1 pJ/bit at 3.5db and 7db. The 16 nm implementation running at 1 GHz and achieves a throughput of 112 Gbps at 4 iterations with area efficiency of 589 Gbps/sqmm and consumes an average power of 408mW and 163mW, yielding energy efficiency of 3.64 pJ/bit and 1.45 pJ/bit at 3.5db and 7db.","PeriodicalId":441111,"journal":{"name":"2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129174715","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
Decoding LDPC Codes on Binary Erasure Channels using Deep Recurrent Neural-Logic Layers 利用深度递归神经逻辑层在二进制擦除信道上解码LDPC码
Ali Payani, F. Fekri
{"title":"Decoding LDPC Codes on Binary Erasure Channels using Deep Recurrent Neural-Logic Layers","authors":"Ali Payani, F. Fekri","doi":"10.1109/ISTC.2018.8625326","DOIUrl":"https://doi.org/10.1109/ISTC.2018.8625326","url":null,"abstract":"Iterative algorithms based on belief propagation can perform very close to optimal ML decoding for long LDPC codes. However, for short LDPC codes over Binary Erasure Channels (BEC) their performance drops significantly. In this paper, we introduce an iterative LDPC decoder over BEC by using our novel deep recurrent neural logic networks that learns Boolean logic algebra. It turned out that the neural logic network is capable of learning discrete algorithmic tasks and suitable for decoding LDPC codes. We show that the proposed decoding method can outperform the belief propagation algorithm for short LDPC code while using significantly fewer number of iterations. We further demonstrate that the proposed model is able to generalize very well. In other words, the model that was trained for specific settings such as channel erasure, parity check matrix, and code length, when tested under various other settings, still performed almost as if it was trained for those new settings.","PeriodicalId":441111,"journal":{"name":"2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC)","volume":"86 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116307360","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Scalable Globally-Coupled Low-Density Parity Check Codes 可扩展的全球耦合低密度奇偶校验码
Yen-Chin Liao, Hsie-Chia Chang, Shu Lin
{"title":"Scalable Globally-Coupled Low-Density Parity Check Codes","authors":"Yen-Chin Liao, Hsie-Chia Chang, Shu Lin","doi":"10.1109/ISTC.2018.8625302","DOIUrl":"https://doi.org/10.1109/ISTC.2018.8625302","url":null,"abstract":"This paper presents a technique to scale up an LDPC code to any desired block length. Under certain constraints, the scaled LDPC code results in a special case of globally-coupled-LDPC code. The proposed scheme can construct globally-coupled-LDPC codes from any short LDPC codes. A design example targeting for NAND flash memory applications is addressed and simulated. The results show the feasibility of constructing a structural long LDPC code by scaling from a short code.","PeriodicalId":441111,"journal":{"name":"2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117316336","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
A Turbo-Hadamard Encoder/Decoder System with Hundreds of Mbps Throughput 具有数百Mbps吞吐量的Turbo-Hadamard编码器/解码器系统
Sheng Jiang, Pengwei Zhang, F. Lau, Chiu-Wing Sham, Kechao Huang
{"title":"A Turbo-Hadamard Encoder/Decoder System with Hundreds of Mbps Throughput","authors":"Sheng Jiang, Pengwei Zhang, F. Lau, Chiu-Wing Sham, Kechao Huang","doi":"10.1109/ISTC.2018.8625371","DOIUrl":"https://doi.org/10.1109/ISTC.2018.8625371","url":null,"abstract":"A turbo-Hadamard code (THC) is a type of low-rate channel code with capacity approaching the ultimate Shannon limit, i.e., −1.6 dB. In this paper, we investigate the hardware implementation of a turbo-Hadamard encoder/decoder system. In particular, we study THC systems with rates 0.0114 and 0.0143. With channel messages quantized into 6 bits, we show that the degradation compared with floating-point computation is within 0.15 dB. The entire system has been implemented on a FPGA board. When the code rate equals 0.0143, a bit error rate (BER) of 10−5 can be achieved at around Eb/N0 = −0.3 dB with a throughput of about 600 Mbps.","PeriodicalId":441111,"journal":{"name":"2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC)","volume":"233 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114750598","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Low Latency mmWave Backhaul via Traffic Dispersion 低延迟毫米波回程通过业务分散
Chandan Pradhan, Ang Li, H. Chen, Yonghui Li, B. Vucetic
{"title":"Low Latency mmWave Backhaul via Traffic Dispersion","authors":"Chandan Pradhan, Ang Li, H. Chen, Yonghui Li, B. Vucetic","doi":"10.1109/ISTC.2018.8625299","DOIUrl":"https://doi.org/10.1109/ISTC.2018.8625299","url":null,"abstract":"This paper focuses on reducing the beamtraining delay and end-to-end latency using \"traffic dispersion\" in a multi-hop millimeter-wave (mmWave) backhaul link. Traffic dispersion reduces the latency by creating multiple parallel paths between a base station (BS) and the anchored base station (ABS) connected to a core network, to increase the data rate. The beamtraining delay is a major source of end-to-end latency and is particularly crucial in case of outdoor deployment of the mmWave backhaul link, suffering from frequent beam outage due to beam misalignment caused by wind or ground vibrations, thereby lowering its coherence time. We formulate an optimization problem to minimize the beamtraining delay by jointly optimizing the power allocation and beamwidths in paths between the BS and intermediate relay units (RU) and that between RUs and ABS, subject to an end-to-end latency requirement. The problem is mix-integer and non-convex in nature which is challenging to solve in general. Thus, we address the problem using the iterative Practical Swarm Optimization (PSO) in conjunction with penalty function method and primal decomposition, where the transmit power and the beamwidths are iteratively updated. Numerical results show the robustness of the proposed algorithm in reducing the beamtraining delay and end-to-end latency for mmWave backhaul link with a varying coherence time.","PeriodicalId":441111,"journal":{"name":"2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131929255","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书