A hybrid breadth/depth first technique to improve convolutionally encoded /spl pi/4-shifted DQPSK over asynchronous CDMA fading channels

M. Martone, V. E. Maragliano, A. Spazio
{"title":"A hybrid breadth/depth first technique to improve convolutionally encoded /spl pi/4-shifted DQPSK over asynchronous CDMA fading channels","authors":"M. Martone, V. E. Maragliano, A. Spazio","doi":"10.1109/ISSSTA.1994.379584","DOIUrl":null,"url":null,"abstract":"A direct sequence spread spectrum multiple access communication system based on differential /spl pi/4-shifted QPSK modulation and convolutional coding is analyzed. The channel model is frequency selective fading typical of mobile digital radio systems. An efficient decoding scheme is proposed to relieve performance losses at the receiver due to user interference. Sequential decoding is a valid alternative to Viterbi decoding, and particularly the backtracking algorithm when long constraints convolutional codes are imposed by system performance. Purely breadth first sequential decoding algorithms such as the M-algorithm present inherent parallelism (adapt to a parallel HW realization) but are, as pointed out by Anderson [1992], less efficient in terms of average number of paths searched with respect to the backtracking algorithm, while representing a search performed by the Viterbi algorithm. The authors propose a technique which is a modified version of a Fano-like algorithm in which the forward operations are performed by means of a breadth first algorithm: this modification presents many advantages. First of all, backtracking events are limited. In this way the decoder proceeds faster and with a lower delay. Second: the searches are made in parallel, allowing a smaller buffering and hence a simpler VLSI realization with respect to the traditional Fano decoder. An analysis is performed of the uncoded detection scheme and the results of the simulations of the encoded scheme are compared. Large coding gains seem possible when employing an adapt interleaving and an efficient power control system.<<ETX>>","PeriodicalId":158358,"journal":{"name":"Proceedings of IEEE 3rd International Symposium on Spread Spectrum Techniques and Applications (ISSSTA'94)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of IEEE 3rd International Symposium on Spread Spectrum Techniques and Applications (ISSSTA'94)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISSSTA.1994.379584","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

A direct sequence spread spectrum multiple access communication system based on differential /spl pi/4-shifted QPSK modulation and convolutional coding is analyzed. The channel model is frequency selective fading typical of mobile digital radio systems. An efficient decoding scheme is proposed to relieve performance losses at the receiver due to user interference. Sequential decoding is a valid alternative to Viterbi decoding, and particularly the backtracking algorithm when long constraints convolutional codes are imposed by system performance. Purely breadth first sequential decoding algorithms such as the M-algorithm present inherent parallelism (adapt to a parallel HW realization) but are, as pointed out by Anderson [1992], less efficient in terms of average number of paths searched with respect to the backtracking algorithm, while representing a search performed by the Viterbi algorithm. The authors propose a technique which is a modified version of a Fano-like algorithm in which the forward operations are performed by means of a breadth first algorithm: this modification presents many advantages. First of all, backtracking events are limited. In this way the decoder proceeds faster and with a lower delay. Second: the searches are made in parallel, allowing a smaller buffering and hence a simpler VLSI realization with respect to the traditional Fano decoder. An analysis is performed of the uncoded detection scheme and the results of the simulations of the encoded scheme are compared. Large coding gains seem possible when employing an adapt interleaving and an efficient power control system.<>
一种改进异步CDMA衰落信道中卷积编码/spl pi/4移DQPSK的宽度/深度优先混合技术
分析了一种基于差分/spl pi/4移QPSK调制和卷积编码的直接序列扩频多址通信系统。信道模型是移动数字无线电系统中典型的频率选择性衰落模型。提出了一种有效的解码方案,以减轻接收端因用户干扰而造成的性能损失。顺序解码是Viterbi解码的有效替代方案,特别是当系统性能强加长约束卷积码时回溯算法。纯粹的宽度优先顺序解码算法,如m算法,具有固有的并行性(适应并行硬件实现),但正如Anderson[1992]所指出的那样,相对于回溯算法,在平均搜索路径数方面效率较低,同时代表了由Viterbi算法执行的搜索。作者提出了一种改进版的类法诺算法,该算法采用宽度优先算法进行前向操作,这种改进具有许多优点。首先,回溯事件是有限的。以这种方式,解码器进行得更快,延迟更低。其次:搜索是并行进行的,允许更小的缓冲,因此相对于传统的Fano解码器更简单的VLSI实现。对非编码检测方案进行了分析,并对编码方案的仿真结果进行了比较。采用自适应交错和有效的功率控制系统时,似乎可以获得较大的编码增益。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信