针对话音/数据集成TDMA/TDD移动无线电中不对称业务的动态信道分配算法

Lan Chen, S. Yoshida, H. Murata, S. Hirose
{"title":"针对话音/数据集成TDMA/TDD移动无线电中不对称业务的动态信道分配算法","authors":"Lan Chen, S. Yoshida, H. Murata, S. Hirose","doi":"10.1109/ICICS.1997.647090","DOIUrl":null,"url":null,"abstract":"Personal communications systems are increasingly required to accommodate not only voice traffic, but also various types of data traffic. Generally speaking, voice traffic is symmetric between the uplink and downlink, while data traffic can be highly asymmetric. It is therefore inefficient to accommodate data in a conventional TDMA/TDD system with a fixed TDD boundary. In this paper, focusing on continuous data traffic which requires multi-slots in a circuit based TDMA/TDD system, we propose an algorithm in which the TDD boundaries are moved adaptively to accommodate data traffic efficiently. Compared with the conventional fixed boundary algorithm, computer simulations confirm that the proposed algorithm has a superior performance in the excessive transmission delay of data while maintaining the performance of voice. Moreover, an almost similar performance improvement of the proposed algorithm is confirmed for two different average message sizes of data calls.","PeriodicalId":71361,"journal":{"name":"信息通信技术","volume":"52 1","pages":"215-219 vol.1"},"PeriodicalIF":0.0000,"publicationDate":"1997-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"A dynamic channel assignment algorithm for asymmetric traffic in voice/data integrated TDMA/TDD mobile radio\",\"authors\":\"Lan Chen, S. Yoshida, H. Murata, S. Hirose\",\"doi\":\"10.1109/ICICS.1997.647090\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Personal communications systems are increasingly required to accommodate not only voice traffic, but also various types of data traffic. Generally speaking, voice traffic is symmetric between the uplink and downlink, while data traffic can be highly asymmetric. It is therefore inefficient to accommodate data in a conventional TDMA/TDD system with a fixed TDD boundary. In this paper, focusing on continuous data traffic which requires multi-slots in a circuit based TDMA/TDD system, we propose an algorithm in which the TDD boundaries are moved adaptively to accommodate data traffic efficiently. Compared with the conventional fixed boundary algorithm, computer simulations confirm that the proposed algorithm has a superior performance in the excessive transmission delay of data while maintaining the performance of voice. Moreover, an almost similar performance improvement of the proposed algorithm is confirmed for two different average message sizes of data calls.\",\"PeriodicalId\":71361,\"journal\":{\"name\":\"信息通信技术\",\"volume\":\"52 1\",\"pages\":\"215-219 vol.1\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-09-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"信息通信技术\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://doi.org/10.1109/ICICS.1997.647090\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"信息通信技术","FirstCategoryId":"1093","ListUrlMain":"https://doi.org/10.1109/ICICS.1997.647090","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

摘要

个人通信系统不仅需要适应语音通信,而且需要适应各种类型的数据通信。一般来说,语音流量在上行和下行之间是对称的,而数据流量可能是高度不对称的。因此,在具有固定TDD边界的传统TDMA/TDD系统中容纳数据是低效的。针对基于电路的TDMA/TDD系统中需要多插槽的连续数据流量问题,提出了一种自适应移动TDD边界以有效适应数据流量的算法。与传统的固定边界算法相比,计算机仿真验证了该算法在保持语音性能的同时,在数据传输延迟过大的问题上具有优越的性能。此外,对于两种不同的数据调用的平均消息大小,所提出的算法的性能改进几乎相似。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A dynamic channel assignment algorithm for asymmetric traffic in voice/data integrated TDMA/TDD mobile radio
Personal communications systems are increasingly required to accommodate not only voice traffic, but also various types of data traffic. Generally speaking, voice traffic is symmetric between the uplink and downlink, while data traffic can be highly asymmetric. It is therefore inefficient to accommodate data in a conventional TDMA/TDD system with a fixed TDD boundary. In this paper, focusing on continuous data traffic which requires multi-slots in a circuit based TDMA/TDD system, we propose an algorithm in which the TDD boundaries are moved adaptively to accommodate data traffic efficiently. Compared with the conventional fixed boundary algorithm, computer simulations confirm that the proposed algorithm has a superior performance in the excessive transmission delay of data while maintaining the performance of voice. Moreover, an almost similar performance improvement of the proposed algorithm is confirmed for two different average message sizes of data calls.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
1369
期刊介绍:
期刊最新文献
HMM speech recognition with reduced training Recovering three dimenensional hand motions of sign language from monocular image sequence A full section overhead processing chip set for 10 Gbit/s SDH-based optical fiber transmission system Processing of sound field signal of a constrained panel by cross-correlation Non-Gaussian signal detection from multiple sensors using the bootstrap
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1