首页> 外国专利> METHOD FOR CONTENTION RESOLUTION IN TIME-HOPPING OR FREQUENCY-HOPPING

METHOD FOR CONTENTION RESOLUTION IN TIME-HOPPING OR FREQUENCY-HOPPING

机译:跳时或跳频中分辨率的方法

摘要

The invention is related to a method of transmitting data, whereby a transmission channel towards an access point is shared among a plurality of users. The data is transmitted by using a multiple access frame divided in logical slots. According to the invention each data packet is divided into k units which are decoded by an (n,k) decoder, producing n−k redundant units. The n units are transmitted within a multiple access frame in n different slots according to a time-hopping pattern, a frequency-hopping pattern or a combination of both. Thereby, the positions of the n units composing a data packet are written in a header appended to each unit.;At the receiver side lost or corrupted data packets are recovered by using the redundant units, whereby the presence of a unit for each slot is detected. If a unit is present in a slot and has been transmitted without collisions, this unit is recovered. The recovered unit and its header are stored in a memory together with an index of the slot where they have been recovered. If a sufficient k+δ amount of units composing a data packet is recovered, the packet level decoder is used to recover the remaining n−k−δ units which experienced collisions in the respective slots.;According to the invention the interference caused by the n−k−δ units from the slots where they were transmitted is removed by using the information about the position of the units contained in the header of the recovered k+δ units. Afterwards, the units of other data packets which have experienced a collision with the n−k−δ units are recovered.
机译:本发明涉及一种传输数据的方法,由此在多个用户之间共享朝向接入点的传输信道。通过使用划分为逻辑时隙的多路访问帧来发送数据。根据本发明,每个数据分组被划分为k个单元,该k个单元由(n,k)个解码器解码,从而产生n-k个冗余单元。根据时间跳变模式,跳频模式或两者的组合,在n个不同的时隙中的多址帧内发送n个单元。从而,构成数据分组的n个单元的位置被写入到附加到每个单元的首部中;在接收器侧,通过使用冗余单元来恢复丢失或损坏的数据分组,由此每个时隙的单元的存在检测到。如果某个单元存在于插槽中并且已传输而没有冲突,则将恢复该单元。恢复的单元及其标题与恢复位置的插槽索引一起存储在存储器中。如果恢复了组成数据分组的足够的k +δ个单元,则使用分组级解码器恢复在各个时隙中发生冲突的剩余的n-k-δ个单元。通过使用关于包含在恢复的k +δ单元的报头中的单元的位置的信息,从发送时隙的n-k-δ单元中删除。之后,恢复与n-k-δ单元发生冲突的其他数据分组的单元。

著录项

  • 公开/公告号US2011096795A1

    专利类型

  • 公开/公告日2011-04-28

    原文格式PDF

  • 申请/专利权人 GIANLUIGI LIVA;

    申请/专利号US20100903246

  • 发明设计人 GIANLUIGI LIVA;

    申请日2010-10-13

  • 分类号H04J3/24;

  • 国家 US

  • 入库时间 2022-08-21 18:13:39

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号