公开(公告)号：US09207305B2

公开(公告)日：2015-12-08

申请号：US13604063

申请日：2012-09-05

Applicant: Nayef AlSindi ,  James Aweya

Inventor： Nayef AlSindi ,  James Aweya

IPC: G01S5/02 ,  H04B17/24 ,  H04B17/27 ,  H04B17/364 ,  H04B17/391

CPC classification number: G01S5/0215 ,  H04B17/24 ,  H04B17/27 ,  H04B17/364 ,  H04B17/391

Abstract: This invention relates to methods and devices for channel identification. The invention is particularly concerned with techniques for non-line of sight channel identification. In embodiments of the invention the methods and devices are used for channel identification in wireless geolocation systems. Embodiments of the invention make use of an entropy estimation of the channel to distinguish channel conditions and in particular to identify line-of-sight and non-line-of-sight channels and which can be used to solve the NLOS problem of determining relative distances between transmitter and receiver. In particular embodiments an entropy estimation of the channel impulse response (CIR) is used to construct a robust entropy-based channel identification technique. As a result, more accurate localization in indoor and other multipath environments may be possible.

Abstract translation: 本发明涉及用于信道识别的方法和装置。 本发明特别涉及非视线通道识别技术。 在本发明的实施例中，方法和装置用于无线地理定位系统中的信道识别。 本发明的实施例利用信道的熵估计来区分信道条件，特别是识别视线和非视距信道，并且其可以用于解决确定相对距离的NLOS问题 在发射机和接收机之间。 在特定实施例中，信道脉冲响应（CIR）的熵估计用于构建基于鲁棒熵的信道识别技术。 因此，在室内和其他多路径环境中更准确的定位是可能的。

公开(公告)号：US08675686B2

公开(公告)日：2014-03-18

申请号：US13162242

申请日：2011-06-16

Applicant: James Aweya ,  Michel Ouellette

Inventor： James Aweya ,  Michel Ouellette

IPC: H04J3/06

CPC classification number: H04J3/065 ,  H04J3/0682 ,  H04J3/0697 ,  H04L67/06 ,  H04W56/0055

Abstract: Techniques for time transfer via signal encoding are disclosed. In one particular exemplary embodiment, the techniques may be realized as a method for time transfer via signal encoding comprising generating a time service ordered-set for inclusion in a physical coding sublayer frame of a physical layer device, generating time service data for inclusion in the physical coding sublayer frame of the physical layer device, and transmitting the physical coding sublayer frame.

Abstract translation: 公开了通过信号编码进行时间传递的技术。 在一个特定的示例性实施例中，这些技术可以被实现为用于经由信号编码的时间传送的方法，包括生成用于包括在物理层设备的物理编码子层帧中的时间服务有序集，生成包括在 物理层设备的物理编码子层帧，并发送物理编码子层帧。

公开(公告)号：US20100150117A1

公开(公告)日：2010-06-17

申请号：US12336671

申请日：2008-12-17

Applicant: James AWEYA ,  Luis Orozco BARBOSA

Inventor： James AWEYA ,  Luis Orozco BARBOSA

IPC: H04W84/02

CPC classification number: G01S5/14 ,  G01S13/46 ,  G01S13/878 ,  G01S2013/466 ,  H04J3/0667

Abstract: A method and system for position location of clients in wireless local area networks. (WLANs). The position location technique utilizes time-of-flight (TOF) measurements of signals transmitted from a client to a number of wireless access points (APs) or vice versa to determine distances. Round-trip time (RTT) measurement protocols are used to estimate TOF and distances between the client at an unknown position and the WLAN APs. The method and system improves positioning accuracy by identifying and mitigating non-line-of sight (NLOS) errors such as multipaths. Trilateration algorithms are utilized in combination with median filtering of measurements to accurately estimate the position of the client.

Abstract translation: 一种在无线局域网中客户端定位的方法和系统。 （WLAN）。 位置定位技术利用从客户端发送到多个无线接入点（AP）的信号的飞行时间（TOF）测量，或反之亦然，以确定距离。 往返时间（RTT）测量协议用于估计TOF和未知位置的客户端与WLAN AP之间的距离。 该方法和系统通过识别和减轻诸如多路径之类的非视距（NLOS）错误来提高定位精度。 三边测量算法与测量的中值滤波结合使用，以准确估计客户端的位置。

公开(公告)号：US20100080248A1

公开(公告)日：2010-04-01

申请号：US12347314

申请日：2008-12-31

Applicant: James Aweya ,  Michel Ouellette

Inventor： James Aweya ,  Michel Ouellette

IPC: H04J3/06

CPC classification number: H04J3/065 ,  H04J3/0682 ,  H04J3/0697 ,  H04L67/06 ,  H04W56/0055

Abstract: Techniques for time transfer via signal encoding are disclosed. In one particular exemplary embodiment, the techniques may be realized as a method for time transfer via signal encoding comprising generating a time service ordered-set for inclusion in a physical coding sublayer frame of a physical layer device, generating time service data for inclusion in the physical coding sublayer frame of the physical layer device, and transmitting the physical coding sublayer frame.

Abstract translation: 公开了通过信号编码进行时间传递的技术。 在一个特定的示例性实施例中，这些技术可以被实现为用于经由信号编码的时间传送的方法，包括生成用于包括在物理层设备的物理编码子层帧中的时间服务有序集，生成包括在 物理层设备的物理编码子层帧，并发送物理编码子层帧。

公开(公告)号：US07492732B2

公开(公告)日：2009-02-17

申请号：US11294146

申请日：2005-12-05

Applicant: James Aweya ,  Michel Ouellette ,  Delfin Montuno ,  Kent Felske

Inventor： James Aweya ,  Michel Ouellette ,  Delfin Montuno ,  Kent Felske

IPC: H04B7/212

CPC classification number: H04J3/0658

Abstract: Where a common network clock is available at both a TDM receiver and a TDM transmitter which communicate via a packet network, differential clock recovery can be accomplished by matching the number of service clock pulses in a network reference clock period at the transmitter and receiver. In one embodiment the transmitter need only send a counter value from a counter that is clocked and reset, respectively, by the service clock and network reference clock, thereby allowing use of different types of oscillators, both analog and digital, to be implemented at the transmitter and receiver. The technique is also general enough to be applied in a wide variety of packet networks including but not limited to IP, MPLS and Ethernet. In an alternative embodiment, a faster derived network clock fdnc drives both the transmitter and receiver counters, which in turn are reset, respectively by the slower transmitter service clock fsc and slower receiver service clock frc.

Abstract translation: 在通过分组网络进行通信的TDM接收机和TDM发射机都可以使用公共网络时钟的情况下，差分时钟恢复可以通过在发射机和接收机的网络参考时钟周期内匹配服务时钟脉冲的数量来实现。 在一个实施例中，发射机仅需要通过服务时钟和网络参考时钟分别从计时器发送计数器值并将其复位，从而允许使用不同类型的模拟和数字振荡器来实现 发射机和接收机。 该技术也足以应用于各种分组网络，包括但不限于IP，MPLS和以太网。 在替代实施例中，更快的导出网络时钟fdnc驱动发射机和接收机计数器，发射机和接收机计数器又分别被较慢的发射机业务时钟fsc和较慢的接收机业务时钟frc复位。

公开(公告)号：US07336672B1

公开(公告)日：2008-02-26

申请号：US10422796

申请日：2003-04-25

Applicant: James Aweya ,  Delfin Y. Montuno ,  Michel Ouellette ,  Zhonghui Yao ,  Victor Firoiu

Inventor： James Aweya ,  Delfin Y. Montuno ,  Michel Ouellette ,  Zhonghui Yao ,  Victor Firoiu

IPC: H04L12/28

CPC classification number: H04L47/10 ,  H04L47/283 ,  H04L47/30 ,  H04L47/32

Abstract: Various techniques for queue management based on random early detection (RED) are disclosed herein. In particular, a method for generating a drop probability for an incoming packet in a device having a queue to buffer packets between segments of a network is provided. The method comprises determining, upon receipt of an incoming packet, a size of the queue and determining an error based at least in part on a difference between the queue size and a threshold. The method further comprises determining a drop probability for the incoming packet based at least in part on the error and a constant gain factor. The constant gain factor may be based at least in part on a linearized second order dynamic model of the network.

Abstract translation: 本文中公开了基于随机早期检测（RED）的队列管理的各种技术。 特别地，提供了一种用于在具有队列以在网络的段之间缓冲分组的设备中生成用于输入分组的丢弃概率的方法。 该方法包括在接收到传入分组时确定队列的大小并且至少部分地基于队列大小与阈值之间的差异来确定错误。 该方法还包括至少部分地基于误差和恒定增益因子确定输入分组的丢弃概率。 恒定增益因子可以至少部分地基于网络的线性化二阶动态模型。

公开(公告)号：US20070097947A1

公开(公告)日：2007-05-03

申请号：US11362697

申请日：2006-02-27

Applicant: James Aweya ,  Michel Ouellette ,  Delfin Montuno ,  Kent Felske

Inventor： James Aweya ,  Michel Ouellette ,  Delfin Montuno ,  Kent Felske

IPC: H04J3/06

CPC classification number: H04J3/065 ,  H04J3/0667

Abstract: The invention includes a technique for clock recovery in a network having master and slave clocks in respective Time Division Multiplexing (“TDM”) network segments which are interconnected by a non-TDM segment. Master clock timestamps are sent to the slave. The slave measures a master clock timestamp inter-arrival interval, and sends slave clock timestamps to the master. The master measures a slave clock timestamp inter-arrival interval, and sends that slave clock timestamp inter-arrival interval to the slave. The slave then calculates an error signal based at least in-part on the difference between the master clock timestamp inter-arrival interval and the slave clock timestamp inter-arrival interval, and employs the difference to recover the first service clock in the second TDM segment.

Abstract translation: 本发明包括一种用于在通过非TDM分段互连的相应时分复用（“TDM”）网段中的主时钟和从时钟的网络中的时钟恢复技术。 主时钟时间戳被发送到从站。 从站测量主时钟时间戳到达间隔时间，并向主机发送从时钟时间戳。 主机测量从时钟时间戳到达间隔时间，并将从属时钟时间戳到到达间隔发送到从机。 然后，从设备至少部分地基于主时钟间隔到达间隔和从时钟时间戳到达间隔之间的差异来计算误差信号，并且采用差异来恢复第二TDM段中的第一服务时钟 。

公开(公告)号：US20050157724A1

公开(公告)日：2005-07-21

申请号：US11034839

申请日：2005-01-14

Applicant: Delfin Montuno ,  James Aweya

Inventor： Delfin Montuno ,  James Aweya

IPC: H03M7/40 ,  H04L12/56

CPC classification number: H04L45/00 ,  H04L45/54 ,  Y10S707/99933

Abstract: A method and apparatus for locating in a list of pre-defined codes, a longest code matching a given code. The method and apparatus involve producing a search mask encoding at least one portion of said given code and comparing the search mask to a search key having a Prefix Node Bit Array (PNBA) in which a bit is set active in at least one of a plurality of bit positions corresponding to possible bit combinations of bits in a bit string having a length equal to or less than the longest predefined code in the plurality of pre-defined codes and arranged by the lengths of possible bit combinations and by numeric values of the bit combinations, to identify a common active bit position in the search key and the search mask corresponding to one of the pre-defined codes having a length greater than all others of said pre-defined codes which correspond to common active bit positions.

Abstract translation: 用于定位在预定义代码列表中的方法和装置，其是与给定代码匹配的最长代码。 所述方法和装置包括产生编码所述给定代码的至少一部分的搜索掩码，并且将搜索掩码与具有前缀节点位阵列（PNBA）的搜索关键字进行比较，其中将位设置为多个 对应于具有等于或小于多个预定义代码中的最长预定义代码的长度的比特串中的比特的可能比特组合的比特位置，并且由可能的比特组合的长度和比特的数值 组合，以识别搜索关键字中的公共活动比特位置和对应于具有大于对应于公共活动比特位置的所述预定义码的所有其他长度的预定义码之一的搜索掩码。

公开(公告)号：US06788697B1

公开(公告)日：2004-09-07

申请号：US09635898

申请日：2000-08-11

Applicant: James Aweya ,  Michel Ouellette ,  Delfin Y. Montuno

Inventor： James Aweya ,  Michel Ouellette ,  Delfin Y. Montuno

IPC: H04L1226

CPC classification number: H04L49/9036 ,  H04L49/90 ,  H04L49/901 ,  H04L49/9026 ,  H04L49/9052 ,  H04L49/9078

Abstract: An improved buffer management process is disclosed wherein the buffer is shared among a plurality of packet queues. The improved buffer management process comprises computing a common queue threshold value based upon the aggregate size of the plurality of packet queues and a predetermined buffer threshold value. The common queue threshold value is then used to manage the size of each of the plurality of packet queues and thereby manage the buffer.

Abstract translation: 公开了一种改进的缓冲器管理过程，其中缓冲器在多个分组队列之间共享。 改进的缓冲器管理过程包括基于多个分组队列的聚合大小和预定的缓冲器阈值来计算公共队列阈值。 然后使用公共队列阈值来管理多个分组队列中的每一个的大小，从而管理缓冲器。

公开(公告)号：US06657983B1

公开(公告)日：2003-12-02

申请号：US09429014

申请日：1999-10-29

Applicant: Mieczyslaw J. Surazski ,  James Aweya ,  Imed Frigui ,  Pierre A. Hamel ,  Delfin Y. Montuno ,  Tong Shan ,  Bernard Thiboutot ,  Genzao G. Zhang

Inventor： Mieczyslaw J. Surazski ,  James Aweya ,  Imed Frigui ,  Pierre A. Hamel ,  Delfin Y. Montuno ,  Tong Shan ,  Bernard Thiboutot ,  Genzao G. Zhang

IPC: H04B7212

CPC classification number: H04B7/2646

Abstract: A method of allocating bandwidth for transmitting upstream cells from a CPE unit to a BTS. The CPE determines arrival time information associated with each cell and sends arrival time information associated with at least one cell to the BTS. The BTS allocates future bandwidth to the CPE as a function of the arrival time information received from the CPE. For example, the BTS estimates the number of cell arrivals occurring in the current scheduling period based on past cell arrival times. The BTS then sends information to the CPE in which the allocated future bandwidth is specified. Finally, the CPE groups a number of cells into a burst packet occupying the allocated bandwidth and sends the burst packet to the BTS. Rather than respond in a delayed manner to a bandwidth deficiency or surplus at an individual CPE unit, the BTS produces an estimate of a CPE unit's bandwidth demands, resulting in more efficient bandwidth utilization and reduced cell loss ratio.

Abstract translation: 分配用于从CPE单元向BTS发送上行小区的带宽的方法。 CPE确定与每个小区相关联的到达时间信息，并将与至少一个小区相关联的到达时间信息发送到BTS。 作为从CPE接收的到达时间信息的函数，BTS将CPE的未来带宽分配给CPE。 例如，BTS基于过去的小区到达时间估计在当前调度周期中发生的小区到达的数量。 BTS然后向CPE发送信息，其中指定了分配的未来带宽。 最后，CPE将多个小区分组成占用分配带宽的突发分组，并将突发分组发送到BTS。 不是以延迟的方式响应单个CPE单元的带宽不足或剩余，所以BTS产生CPE单元的带宽需求的估计，导致更有效的带宽利用和减少的信元丢失率。