Multiuser communication based on the discrete fractional fourier transform

Juliano B. Lima, R. Souza, Daniel C. Cunha
{"title":"Multiuser communication based on the discrete fractional fourier transform","authors":"Juliano B. Lima, R. Souza, Daniel C. Cunha","doi":"10.1109/ICC.2012.6363895","DOIUrl":null,"url":null,"abstract":"In this paper, a multiuser communication technique based on the discrete fractional Fourier transform (DFrFT) is discussed. Eigenvectors of the DFrFT transform matrix are used as user sequences, which are transmitted over a real adder channel. Compared to other transforms used in the same context, the advantage of using the DFrFT is that the sequences can be generated from a systematic procedure and the number of generated subspaces, which determines the maximum number of simultaneous users of a scheme, is arbitrary. After describing the basic idea of our approach, we discuss some aspects related to its practical implementation and present preliminary simulation results.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE International Conference on Communications (ICC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC.2012.6363895","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

In this paper, a multiuser communication technique based on the discrete fractional Fourier transform (DFrFT) is discussed. Eigenvectors of the DFrFT transform matrix are used as user sequences, which are transmitted over a real adder channel. Compared to other transforms used in the same context, the advantage of using the DFrFT is that the sequences can be generated from a systematic procedure and the number of generated subspaces, which determines the maximum number of simultaneous users of a scheme, is arbitrary. After describing the basic idea of our approach, we discuss some aspects related to its practical implementation and present preliminary simulation results.
基于离散分数傅里叶变换的多用户通信
本文讨论了一种基于离散分数傅里叶变换(DFrFT)的多用户通信技术。DFrFT变换矩阵的特征向量作为用户序列,在实加法器信道上传输。与在相同上下文中使用的其他变换相比,使用DFrFT的优点是序列可以从系统过程中生成,并且生成的子空间的数量是任意的,这决定了方案的最大同时用户数量。在描述了我们的方法的基本思想之后,我们讨论了与实际实现有关的一些方面,并给出了初步的仿真结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信