交错正交频分复用的交替交错方案

K. Subramanian, K. Hari
{"title":"交错正交频分复用的交替交错方案","authors":"K. Subramanian, K. Hari","doi":"10.1109/TENCON.2003.1273265","DOIUrl":null,"url":null,"abstract":"We propose a matrix model for the interleaved orthogonal frequency division multiplexing system (IOFDM). Using this model, we show that the interleaving scheme originally proposed for IOFDM is not unique in terms of preserving system complexity. We further show that a class of interleaving matrices yields IOFDM systems with the same complexity as the original IOFDM system. Furthermore, we show that the interleaving scheme does not affect the BER performance of the system as long as the interleaving matrix is unitary.","PeriodicalId":405847,"journal":{"name":"TENCON 2003. Conference on Convergent Technologies for Asia-Pacific Region","volume":"148 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Alternative interleaving schemes for interleaved orthogonal frequency division multiplexing\",\"authors\":\"K. Subramanian, K. Hari\",\"doi\":\"10.1109/TENCON.2003.1273265\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose a matrix model for the interleaved orthogonal frequency division multiplexing system (IOFDM). Using this model, we show that the interleaving scheme originally proposed for IOFDM is not unique in terms of preserving system complexity. We further show that a class of interleaving matrices yields IOFDM systems with the same complexity as the original IOFDM system. Furthermore, we show that the interleaving scheme does not affect the BER performance of the system as long as the interleaving matrix is unitary.\",\"PeriodicalId\":405847,\"journal\":{\"name\":\"TENCON 2003. Conference on Convergent Technologies for Asia-Pacific Region\",\"volume\":\"148 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-10-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"TENCON 2003. Conference on Convergent Technologies for Asia-Pacific Region\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TENCON.2003.1273265\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"TENCON 2003. Conference on Convergent Technologies for Asia-Pacific Region","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TENCON.2003.1273265","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

提出了一种正交频分复用系统(IOFDM)的矩阵模型。利用该模型,我们证明了最初为IOFDM提出的交错方案在保持系统复杂性方面不是唯一的。我们进一步证明了一类交错矩阵产生的IOFDM系统具有与原始IOFDM系统相同的复杂性。此外,我们还证明了只要交错矩阵是统一的,交错方案不会影响系统的误码率性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Alternative interleaving schemes for interleaved orthogonal frequency division multiplexing
We propose a matrix model for the interleaved orthogonal frequency division multiplexing system (IOFDM). Using this model, we show that the interleaving scheme originally proposed for IOFDM is not unique in terms of preserving system complexity. We further show that a class of interleaving matrices yields IOFDM systems with the same complexity as the original IOFDM system. Furthermore, we show that the interleaving scheme does not affect the BER performance of the system as long as the interleaving matrix is unitary.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信