发布求助
文献互助 智能选刊 最新文献

2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)最新文献

筛选
英文 中文
Three-way relaying systems using iterative spatial demapping 使用迭代空间映射的三路中继系统
2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC) Pub Date : 2012-10-08 DOI: 10.1109/ISTC.2012.6325206
K. Anwar, T. Matsumoto
{"title":"Three-way relaying systems using iterative spatial demapping","authors":"K. Anwar, T. Matsumoto","doi":"10.1109/ISTC.2012.6325206","DOIUrl":"https://doi.org/10.1109/ISTC.2012.6325206","url":null,"abstract":"This paper proposes an iterative spatial demapping (ISM) scheme for simultaneous data exchange in three-way relaying systems where each user does not have direct links to the other users. Based on a priori knowledge provided by the decoders, ISM demapper makes the simultaneous data exchange only within two transmission phases by the help of a relay. The proposed structure is very simple since only two 2-state (memory 1) convolutional codes (CC) are used by each user: first CC is with rate-1 as doped accumulator (inner encoder) and the other is with rate-1/2 (outer encoder). The performances are evaluated by computer simulations in additive white Gaussian noise (AWGN) and two cascaded frequency-flat block Rayleigh fading channels. Bit-error-rate (BER) performance results show that clear turbo cliff can be achieved, with a transmit power close enough to the theoretical limit, for each user in AWGN channels. Extrinsic information transfer (EXIT) chart analysis is also presented to evaluate the convergence property of the iterative decoding algorithm. Since the proposed technique is spectrally efficient, it has a plenty of potential applications for future multi-way relaying systems where power and spectrum efficiency as well as energy consumption due to signal processing are of significant importance.","PeriodicalId":197982,"journal":{"name":"2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117284972","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
Generalized LDPC code with single-parity-check product constraints at super check nodes 在超校验节点上具有单校验积约束的广义LDPC码
2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC) Pub Date : 2012-10-08 DOI: 10.1109/ISTC.2012.6325220
Y. Min, F. Lau, C. Tse
{"title":"Generalized LDPC code with single-parity-check product constraints at super check nodes","authors":"Y. Min, F. Lau, C. Tse","doi":"10.1109/ISTC.2012.6325220","DOIUrl":"https://doi.org/10.1109/ISTC.2012.6325220","url":null,"abstract":"Due to the more complex constraints, generalized low-density parity-check (GLDPC) codes can achieve better error performance but require much higher decoding complexities compared with the standard LDPC codes. In this paper, single-parity-check product-codes (SPC-PCs) are considered as the constituent codes in the super check nodes of a GLDPC code. Moreover, turbo iterations are used in decoding the SPC-PCs. The error performance and the decoder complexity of the proposed GLDPC code are compared with other LDPC code and GLDPC code.","PeriodicalId":197982,"journal":{"name":"2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124078986","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
Near Shannon limit precoded concatenated zigzag codes 近香农极限预编码串联之字形码
2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC) Pub Date : 2012-10-08 DOI: 10.1109/ISTC.2012.6325212
Sheng Tong, L. Ping, B. Bai
{"title":"Near Shannon limit precoded concatenated zigzag codes","authors":"Sheng Tong, L. Ping, B. Bai","doi":"10.1109/ISTC.2012.6325212","DOIUrl":"https://doi.org/10.1109/ISTC.2012.6325212","url":null,"abstract":"Concatenated zigzag (CZ) codes are a class of multidimensional parallel concatenated codes, which have some favorable properties, such as low encoding and decoding complexities and rate compatibility. However, there is a noticeable gap between the performance of a standard CZ code and the corresponding Shannon limit. To overcome this problem, we apply the precoding technique recently developed by Abbasfar et al. to CZ codes, resulting in a novel class of turbo-like codes, termed precoded CZ codes. The EXIT chart tool is used for convergence analysis and performance optimization. We show that the proposed precoded CZ codes have thresholds within 0.25 dB of the Shannon limit for a wide code rate range of [0.5, 20/21]. Extensive simulation results are provided to demonstrate that optimized precoded CZ codes exhibit good performance at different code rates and different block lengths.","PeriodicalId":197982,"journal":{"name":"2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124902152","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
Iterative collision resolution for slotted ALOHA: An optimal uncoordinated transmission policy 开槽ALOHA的迭代冲突解决:一种最优非协调传输策略
2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC) Pub Date : 2012-10-08 DOI: 10.1109/ISTC.2012.6325214
K. Narayanan, H. Pfister
{"title":"Iterative collision resolution for slotted ALOHA: An optimal uncoordinated transmission policy","authors":"K. Narayanan, H. Pfister","doi":"10.1109/ISTC.2012.6325214","DOIUrl":"https://doi.org/10.1109/ISTC.2012.6325214","url":null,"abstract":"We consider a multi-user wireless network in which each user has one packet of information to transmit to a central receiver. We study an uncoordinated paradigm where the users send their packet a random number of times according to a probability distribution. Instead of discarding the collided packets, the receiver performs iterative collision resolution. Recently, a few studies have shown that the iterative collision resolution process can be viewed as message-passing decoding on an appropriately defined Tanner graph. Using this equivalence, they used standard techniques to numerically optimize the probability distribution and demonstrated substantial throughput improvement over slotted ALOHA. In this paper, we show that the well-known soliton distribution is an optimal probability distribution and that the resulting throughput efficiency can be arbitrarily close to 1.","PeriodicalId":197982,"journal":{"name":"2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132358572","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}
引用次数: 111
Iterative equalization in non-linear satellite channels 非线性卫星信道中的迭代均衡
2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC) Pub Date : 2012-10-08 DOI: 10.1109/ISTC.2012.6325231
D. Liu, M. Fitz
{"title":"Iterative equalization in non-linear satellite channels","authors":"D. Liu, M. Fitz","doi":"10.1109/ISTC.2012.6325231","DOIUrl":"https://doi.org/10.1109/ISTC.2012.6325231","url":null,"abstract":"The nonlinear distortion in efficiently operated wide bandwidth and high power amplifiers often limits the throughput and performance of satellite communications. Volterra series decomposition provides an efficient and analytically tractable way to represent the nonlinear satellite communication channel. Realizing that only a few dominant terms in the Volterra series are needed to accurately describe the channel, this paper proposes a computationally efficient nonlinear soft interference cancellation (SIC) minimum mean square error (MMSE) equalizer. Simulation demonstrates that the nonlinear SIC MMSE equalizer outperforms its linear counter part in performance while achieving an 80% computational complexity reduction.","PeriodicalId":197982,"journal":{"name":"2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125669544","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
Adapted scheduling of QC-LDPC decoding for multistandard receivers 多标准接收机QC-LDPC译码的自适应调度
2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC) Pub Date : 2012-08-27 DOI: 10.1109/ISTC.2012.6325209
J. Dion, Marie-Hélène Hamon, P. Penard, M. Arzel, M. Jézéquel
{"title":"Adapted scheduling of QC-LDPC decoding for multistandard receivers","authors":"J. Dion, Marie-Hélène Hamon, P. Penard, M. Arzel, M. Jézéquel","doi":"10.1109/ISTC.2012.6325209","DOIUrl":"https://doi.org/10.1109/ISTC.2012.6325209","url":null,"abstract":"Wireless and PLC standards have to cope with noisy channels. The advanced FEC codes like LDPC and turbo codes are the most competitive ones. Multi-standards devices (such as mobile phones with cellular and WiFi) are becoming more and more attractive but raise the issue of duplicating hardware. Trellis decoding is a good solution to share material and to achieve good throughputs on FEC multi-standard decoders. Such a technique added with natural parallelism underlines access memory conflicts on the LDPC decoding process, which decreases the decoding performance. This paper presents an optimized trellis design to avoid these access conflicts with no loss in decoding performance.","PeriodicalId":197982,"journal":{"name":"2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130726456","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}
引用次数: 1
Adaptive complexity MIMO turbo receiver applying turbo demodulation 采用turbo解调的自适应复杂MIMO turbo接收机
2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC) Pub Date : 2012-08-27 DOI: 10.1109/ISTC.2012.6325234
Salim Haddad, A. Baghdadi, M. Jézéquel
{"title":"Adaptive complexity MIMO turbo receiver applying turbo demodulation","authors":"Salim Haddad, A. Baghdadi, M. Jézéquel","doi":"10.1109/ISTC.2012.6325234","DOIUrl":"https://doi.org/10.1109/ISTC.2012.6325234","url":null,"abstract":"Robust, flexible, and high throughput are key features for future wireless Multi-Input Multi-Output (MIMO) communication system implementations. Furthermore, iterative processing is being widely investigated and proposed nowadays to cope with the increasing transmission quality requirement. However, these advanced techniques pose a real challenge in terms of complexity. A typical example in this domain is the significant performance improvement offered by the use of turbo equalization with turbo decoding for applications where the propagation channel experiences multipath effects. For this iterative system, and targeting a reduced complexity MIMO turbo receiver with high error correction feature for different modulation schemes and code rates, we analyze the impact of the demapper taking into account the a priori information (turbo demodulation) on the MIMO system complexity. We demonstrate that the adoption of turbo demodulation in this context can lead to significant complexity reduction for specific system configurations. Simulations show that applying feedback to the demapper reduces the overall number of iterations (thus arithmetic operations and memory accesses) for all modulations schemes except for QPSK. This reduction in number of iterations is obtained along with lower error rate performances. Results show a complexity reduction which can reach 24.5% in arithmetic operations and 31.8% in write access memory for QAM16 modulation scheme with 4×4 MIMO Spatial Multiplexing (SM) antenna.","PeriodicalId":197982,"journal":{"name":"2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126499330","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
Synchronization from deletions through interactive communication 通过交互通信从删除同步
2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC) Pub Date : 2012-07-02 DOI: 10.1109/ISTC.2012.6325200
S. M. T. Yazdi, L. Dolecek
{"title":"Synchronization from deletions through interactive communication","authors":"S. M. T. Yazdi, L. Dolecek","doi":"10.1109/ISTC.2012.6325200","DOIUrl":"https://doi.org/10.1109/ISTC.2012.6325200","url":null,"abstract":"In this paper we consider a synchronization problem between nodes A and B that are connected through a two-way communication channel. Node A contains a binary file X of length n and node B contains a binary file Y that is generated by randomly deleting bits from X, by a small deletion rate β. We offer a deterministic synchronization scheme between nodes A and B that needs O(nβ log 1/β)1 transmissions to reconstruct X at node B. The rate of our scheme matches the optimal rate for this channel up to a multiplicative constant and the running time of our scheme is O(n4β6).","PeriodicalId":197982,"journal":{"name":"2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122510598","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}
引用次数: 15
A simple proof of threshold saturation for coupled scalar recursions 耦合标量递归阈值饱和的一个简单证明
2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC) Pub Date : 2012-04-25 DOI: 10.1109/ISTC.2012.6325197
A. Yedla, Yung-Yih Jian, Phong S. Nguyen, H. Pfister
{"title":"A simple proof of threshold saturation for coupled scalar recursions","authors":"A. Yedla, Yung-Yih Jian, Phong S. Nguyen, H. Pfister","doi":"10.1109/ISTC.2012.6325197","DOIUrl":"https://doi.org/10.1109/ISTC.2012.6325197","url":null,"abstract":"Low-density parity-check (LDPC) convolutional codes (or spatially-coupled codes) have been shown to approach capacity on the binary erasure channel (BEC) and binary-input memoryless symmetric channels. The mechanism behind this spectacular performance is the threshold saturation phenomenon, which is characterized by the belief-propagation threshold of the spatially-coupled ensemble increasing to an intrinsic noise threshold defined by the uncoupled system. In this paper, we present a simple proof of threshold saturation that applies to a broad class of coupled scalar recursions. The conditions of the theorem are verified for the density-evolution (DE) equations of irregular LDPC codes on the BEC, a class of generalized LDPC codes, and the joint iterative decoding of LDPC codes on intersymbol-interference channels with erasure noise. Our approach is based on potential functions and was motivated mainly by the ideas of Takeuchi et al. The resulting proof is surprisingly simple when compared to previous methods.","PeriodicalId":197982,"journal":{"name":"2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133940693","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}
引用次数: 84
Ultra low complexity soft output detector for non-binary LDPC coded large MIMO systems 用于非二进制LDPC编码大型MIMO系统的超低复杂度软输出检测器
2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC) Pub Date : 2012-04-18 DOI: 10.1109/ISTC.2012.6325233
Puripong Suthisopapan, Anupap Meesomboon, K. Kasai, V. Imtawil
{"title":"Ultra low complexity soft output detector for non-binary LDPC coded large MIMO systems","authors":"Puripong Suthisopapan, Anupap Meesomboon, K. Kasai, V. Imtawil","doi":"10.1109/ISTC.2012.6325233","DOIUrl":"https://doi.org/10.1109/ISTC.2012.6325233","url":null,"abstract":"The theoretic results of MIMO capacity tell us that the higher the number of antennas are employed, the higher the transmission rate is. This makes MIMO systems with hundreds of antennas very attractive but one of the major problems that obstructs such large dimensional MIMO systems from the practical realization is a high complexity of the MIMO detector. We present in this paper the new soft output MIMO detector based on matched filtering that can be applied to the large MIMO systems which are coded by the powerful non-binary LDPC codes. The per-bit complexity of the proposed detector is just 0.28% to that of low complexity soft output MMSE detector and scales only linearly with a number of antennas. Furthermore, the coded performances with small information length 800 bits are within 4.2 dB from the associated MIMO capacity.","PeriodicalId":197982,"journal":{"name":"2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123759871","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
首页 上一页 下一页 尾页
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学术官方微信