{"title":"基于离散分数傅里叶变换的多用户通信","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":"{\"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}","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}
Multiuser communication based on the discrete fractional fourier transform
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.