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

Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)最新文献

筛选
英文 中文
On interference cancellation and iterative techniques 干扰消除与迭代技术
Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494) Pub Date : 2001-09-02 DOI: 10.1109/ITW.2001.955129
R. Kohno, R. Morelos-Zaragoza
{"title":"On interference cancellation and iterative techniques","authors":"R. Kohno, R. Morelos-Zaragoza","doi":"10.1109/ITW.2001.955129","DOIUrl":"https://doi.org/10.1109/ITW.2001.955129","url":null,"abstract":"Recent research activities in the area of mobile radio communications have moved to third generation (3G) cellular systems to achieve higher quality with variable transmission rate of multimedia information. In this paper, an overview is presented of various interference cancellation and iterative detection techniques that are believed to be suitable for 3G wireless communications systems. Key concepts are space-time processing and space-division multiple access (or SDMA) techniques. SDMA techniques are possible with software antennas. Furthermore, to reduce receiver implementation complexity, iterative detection techniques are considered. A particularly attractive method uses tentative hard decisions, made on the received positions with the highest reliability, according to some criterion, and can potentially yield an important reduction in the computational requirements of an iterative receiver, with minimum penalty in error performance. A study of the tradeoffs between complexity and performance loss of iterative multiuser detection techniques is a good research topic.","PeriodicalId":288814,"journal":{"name":"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127397924","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}
引用次数: 2
Robust space-time codes for time-selective fading 时间选择性衰落的鲁棒空时码
Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494) Pub Date : 2001-09-02 DOI: 10.1109/ITW.2001.955155
Z. Hong, B. Hughes
{"title":"Robust space-time codes for time-selective fading","authors":"Z. Hong, B. Hughes","doi":"10.1109/ITW.2001.955155","DOIUrl":"https://doi.org/10.1109/ITW.2001.955155","url":null,"abstract":"We consider the design of robust codes that exploit both space and time diversity, using bit-interleaved coded modulation. Under quasi-static fading conditions, codes constructed in this way achieve full diversity and perform close to the best space-time trellis codes of comparable complexity. Under fast-fading conditions, these same codes achieve higher diversity than previously known codes of the same complexity.","PeriodicalId":288814,"journal":{"name":"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126811137","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
Low-dimensional spreading matrices for multiuser space-time modulation 多用户时空调制的低维扩展矩阵
Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494) Pub Date : 2001-09-02 DOI: 10.1109/ITW.2001.955133
M. Brehler, M. Varanasi
{"title":"Low-dimensional spreading matrices for multiuser space-time modulation","authors":"M. Brehler, M. Varanasi","doi":"10.1109/ITW.2001.955133","DOIUrl":"https://doi.org/10.1109/ITW.2001.955133","url":null,"abstract":"In a previous paper we proposed a multiuser space-time modulation scheme that leverages single-user space-time constellations and guarantees both, a full diversity order, as well as an asymptotic (high SNR) single-user like performance for every user. This is achieved by multiplying each user's space-time information matrix symbol by a low-dimensional \"spreading matrix.\" For instance, for N/sub T/-transmit antennas per user and if the single-user space-time constellation employed requires only the minimum dimension N/sub T/, no more than N/sub T/+1 dimensions are required for the common signal space of all users, i.e., each user's spreading matrix is of size (N/sub T/+1)/spl times/N/sub T/, independent of the number of users. In this paper, we present a simplified design criterion to obtain these spreading matrices by numerical optimization. Since the columns of each user's spreading matrix are constrained to be orthonormal, we propose to perform the optimization using a parameterization of the Grassmann manifold. A special feature of the simplified criterion, and thus of the resulting spreading matrices, is that they are independent of the particular single-user space-time constellations (of a given dimension), so that different spectral efficiencies can be attained without changing or redesigning the spreading matrices.","PeriodicalId":288814,"journal":{"name":"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128868472","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
Analog decoding and beyond 模拟解码及超越
Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494) Pub Date : 2001-09-02 DOI: 10.1109/ITW.2001.955159
Hans-Andrea Loeliger
{"title":"Analog decoding and beyond","authors":"Hans-Andrea Loeliger","doi":"10.1109/ITW.2001.955159","DOIUrl":"https://doi.org/10.1109/ITW.2001.955159","url":null,"abstract":"In 1998, Hagenauer and Loeliger et al. independently proposed to decode error correcting codes by analog electronic networks. In contrast to previous work on analog Viterbi decoders, the work both by Hagenauer and by Loeliger et al. was inspired by turbo-style decoding of codes described by graphs. Large gains, in terms of speed or power consumption, over digital implementations were envisaged. Since 1998, much effort has been spent towards turning these ideas into working chips. While only decoders of \"toy\" codes have so far been successfully manufactured, extensive simulations of such circuits have not revealed any fundamental problems. Some progress has also been made in analyzing the effects of transistor mismatch. While much remains to be learned, the author feels confident that analog decoders will eventually find their way into applications. The present paper, rather than reporting on circuit details, offers some thoughts on \"the bigger picture\"- the underlying principles, motivations, and possible directions of future research.","PeriodicalId":288814,"journal":{"name":"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)","volume":"11 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120903664","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}
引用次数: 11
Iterative multiuser joint detection and parameter estimation: a factor-graph approach 迭代多用户联合检测与参数估计:一种因子图方法
Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494) Pub Date : 2001-09-02 DOI: 10.1109/ITW.2001.955128
G. Caire, A. Tulino, E. Biglieri
{"title":"Iterative multiuser joint detection and parameter estimation: a factor-graph approach","authors":"G. Caire, A. Tulino, E. Biglieri","doi":"10.1109/ITW.2001.955128","DOIUrl":"https://doi.org/10.1109/ITW.2001.955128","url":null,"abstract":"We examine a multiple-access AWGN channel with synchronous DS-CDMA in which the channel amplitude and noise variance parameters are unknown a priori. We derive an iterative joint multiuser decoder and parameter estimator based on soft interference cancellation and on soft decision-driven least-squares estimation. Our derivation is obtained by applying the sum-product algorithm to the factor graph of the joint a posteriori probability measure of the information bits and of the unknown channel parameters.","PeriodicalId":288814,"journal":{"name":"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124275748","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}
引用次数: 20
Unequal error protection applied to JPEG image transmission using turbo codes 不等错误保护在JPEG图像传输中的应用
Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494) Pub Date : 2001-09-02 DOI: 10.1109/ITW.2001.955137
W. Xiang, S. A. Barbulescu, S. S. Pietrobon
{"title":"Unequal error protection applied to JPEG image transmission using turbo codes","authors":"W. Xiang, S. A. Barbulescu, S. S. Pietrobon","doi":"10.1109/ITW.2001.955137","DOIUrl":"https://doi.org/10.1109/ITW.2001.955137","url":null,"abstract":"An investigation of unequal error protection (UEP) methods applied to JPEG image transmission using turbo codes is presented. The JPEG image is partitioned into two groups, i.e., DC components and AC components according to their respective sensitivity to channel noise. The highly sensitive DC components are better protected with a lower coding rate, while the less sensitive AC components use a higher coding rate. Simulation results are given to demonstrate how the UEP schemes outperforms the equal error protection (EEP) scheme in terms of bit error rate (BER) and peak signal to noise ratio (PSNR).","PeriodicalId":288814,"journal":{"name":"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)","volume":"115 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121266085","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}
引用次数: 34
Design of space-time turbo TCM on fading channels 衰落信道下时空turbo TCM的设计
Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494) Pub Date : 2001-09-02 DOI: 10.1109/ITW.2001.955158
Jinhong Yuan, B. Vucetic, Zhuo Chen, W. Firmanto
{"title":"Design of space-time turbo TCM on fading channels","authors":"Jinhong Yuan, B. Vucetic, Zhuo Chen, W. Firmanto","doi":"10.1109/ITW.2001.955158","DOIUrl":"https://doi.org/10.1109/ITW.2001.955158","url":null,"abstract":"Novel code design criteria for space-time codes on slow Rayleigh fading channels are presented. It is shown that the code performance is dominated by the minimum rank r and the minimum determinant of the codeword distance matrix when the product of the minimum rank r and the number of receive antennas n/sub R/ is less than 4. However, when r/spl middot/n/sub R/ is greater than or equal to 4, the code error performance is dominated by the minimum trace of the codeword distance matrix. Furthermore, we present recursive spacetime trellis coded modulation (STTC) which outperforms feedforward STTC on slow and fast fading channels. A substantial increase in performance can be obtained by constructing spacetime turbo trellis coded modulation (ST turbo TCM) which consists of concatenated recursive STTC, decoded by iterative decoding algorithm. The proposed recursive STTC are used as constituent codes in this scheme. The proposed ST turbo TCM significantly outperforms the best known STTC on both slow and fast fading channels.","PeriodicalId":288814,"journal":{"name":"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115607569","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
Joint decoding of serially concatenated coded CDMA: iterative schedule study 串联编码CDMA的联合解码:迭代调度研究
Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494) Pub Date : 2001-09-02 DOI: 10.1109/ITW.2001.955135
Zhenning Shi, C. Schlegel
{"title":"Joint decoding of serially concatenated coded CDMA: iterative schedule study","authors":"Zhenning Shi, C. Schlegel","doi":"10.1109/ITW.2001.955135","DOIUrl":"https://doi.org/10.1109/ITW.2001.955135","url":null,"abstract":"Joint iterative decoding of forward error control (FEC) encoded code-division multiple-access (CDMA) systems is studied. Serially concatenated convolutional codes are used as FEC codes. We apply iterative decoding to this system and study the effect of component decoders and different decoding partition schemes via a variance transfer analysis. It is shown that distinct partition schemes result in similar pinch off SNRs.","PeriodicalId":288814,"journal":{"name":"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127230855","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
Asymptotic analysis of widely linear MMSE multiuser detection-complex vs real modulation 宽线性MMSE多用户检测复合体与实际调制的渐近分析
Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494) Pub Date : 2001-09-02 DOI: 10.1109/ITW.2001.955134
A. Lampe, M. Breiling
{"title":"Asymptotic analysis of widely linear MMSE multiuser detection-complex vs real modulation","authors":"A. Lampe, M. Breiling","doi":"10.1109/ITW.2001.955134","DOIUrl":"https://doi.org/10.1109/ITW.2001.955134","url":null,"abstract":"We give the asymptotic signal-to-interference ratio for the so-called widely linear minimum mean-squared error multiuser receiver for transmission of multiple users to a common receiver with DS-CDMA. Observing that widely linear multiuser detection virtually doubles the spreading factor, we show that transmission with real-valued channel symbols can lead to a higher spectral efficiency than with complex-valued channel symbols when each user employs its own complex-valued random spreading sequence.","PeriodicalId":288814,"journal":{"name":"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122393152","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}
引用次数: 31
Coding for relay channels with confidential messages 对带有机密信息的中继信道进行编码
Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494) Pub Date : 2001-09-02 DOI: 10.1109/ITW.2001.955145
Y. Oohama
{"title":"Coding for relay channels with confidential messages","authors":"Y. Oohama","doi":"10.1109/ITW.2001.955145","DOIUrl":"https://doi.org/10.1109/ITW.2001.955145","url":null,"abstract":"We consider a relay channel where a relay helps the transmission of messages from one sender to one receiver. The relay is considered not only as a sender that helps the message transmission but as a wire-tapper who can obtain some knowledge about the transmitted messages. In this paper we study the coding problem of the relay channel under the situation that some of transmitted messages are confidential to the relay. A security of such confidential messages is measured by the conditional entropy. We derive an explicit inner bound of the capacity region characterized with the set of transmission rates for which messages are reliably transmitted and the security of confidential messages is larger than a prescribed level.","PeriodicalId":288814,"journal":{"name":"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134263125","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}
引用次数: 163
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信