专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

51. 发明授权

US09554348B2 Timing synchronization of wireless networks 有权
标题翻译：无线网络的时序同步
公开(公告)号：US09554348B2
公开(公告)日：2017-01-24
申请号：US13906117
申请日：2013-05-30
申请人： Somasundaram Niranjayan , Andreas F. Molisch
发明人： Somasundaram Niranjayan , Andreas F. Molisch
IPC分类号： H04J3/06 , H04W56/00 , H04B7/26
CPC分类号： H04W56/0055 , H04B7/2662 , H04J3/0667 , H04J3/0673
摘要： A single wireless slave node may be in a timing virtual network (TVN) with neighboring wireless slave nodes. The single wireless slave node may store information indicative of the identity, link propagation delay, and channel signature of each of its neighboring wireless slave nodes. The single wireless slave node may repeatedly update a timing estimate based on the stored information and by performing a physical layer fast reference signal broadcast transmission and reception.
摘要翻译：单个无线从节点可以在具有相邻无线从节点的定时虚拟网络（TVN）中。单个无线从节点可以存储指示其相邻无线从节点中的每一个的身份，链路传播延迟和信道签名的信息。单个无线从节点可以基于所存储的信息并且通过执行物理层快速参考信号广播发送和接收来重复地更新定时估计。

52. 发明申请

US20130322426A1 TIMING SYNCHRONIZATION OF WIRELESS NETWORKS 有权
标题翻译：无线网络的时序同步
公开(公告)号：US20130322426A1
公开(公告)日：2013-12-05
申请号：US13906117
申请日：2013-05-30
申请人： Andreas F. Molisch , Somasundaram Niranjayan
发明人： Somasundaram Niranjayan , Andreas F. Molisch
IPC分类号： H04W56/00
CPC分类号： H04W56/0055 , H04B7/2662 , H04J3/0667 , H04J3/0673
摘要： A single wireless slave node may be in a timing virtual network (TVN) with neighboring wireless slave nodes. The single wireless slave node may store information indicative of the identity, link propagation delay, and channel signature of each of its neighboring wireless slave nodes. The single wireless slave node may repeatedly update a timing estimate based on the stored information and by performing a physical layer fast reference signal broadcast transmission and reception.
摘要翻译：单个无线从节点可以在具有相邻无线从节点的定时虚拟网络（TVN）中。单个无线从节点可以存储指示其相邻无线从节点中的每一个的身份，链路传播延迟和信道签名的信息。单个无线从节点可以基于所存储的信息并且通过执行物理层快速参考信号广播发送和接收来重复地更新定时估计。

53. 发明授权

US08046029B2 Method for selecting antennas in a wireless networks 有权
标题翻译：在无线网络中选择天线的方法
公开(公告)号：US08046029B2
公开(公告)日：2011-10-25
申请号：US12055522
申请日：2008-03-26
申请人： Koon Hoo Teo , Neelesh B. Mehta , Andreas F. Molisch
发明人： Koon Hoo Teo , Neelesh B. Mehta , Andreas F. Molisch
IPC分类号： H04M1/00
CPC分类号： H04B7/0691 , H04B7/0874
摘要： A method selects antennas in a wireless network including a base station and one or more transceivers. The base station specifies times, subcarriers and subsets of antennas to use to transmit sounding reference signals (SRS) to the base station. Then, the transceiver transmits the SRS according to the specified times and subcarriers using different subsets of the set antennas. The SRS are received in the base station, and the base station selects one of the different subset of the antennas based on the received SRS, and indicates the selected subset of the antennas to the transceiver.
摘要翻译：一种方法选择包括基站和一个或多个收发器的无线网络中的天线。基站指定用于向基站发送探测参考信号（SRS）的时间，子载波和天线子集。然后，收发器使用设定天线的不同子集，根据指定的时间和子载波来发送SRS。在基站中接收SRS，并且基站基于所接收的SRS选择天线的不同子集中的一个，并将所选天线的子集指示给收发机。

54. 发明授权

US07822029B2 Method for routing packets in ad-hoc networks with partial channel state information 有权
标题翻译：在具有部分信道状态信息的自组织网络中路由分组的方法
公开(公告)号：US07822029B2
公开(公告)日：2010-10-26
申请号：US12271200
申请日：2008-11-14
申请人： Matthew Brand , Andreas F. Molisch
发明人： Matthew Brand , Andreas F. Molisch
IPC分类号： H04L12/56
CPC分类号： H04W40/08 , Y02D70/22 , Y02D70/324
摘要： A method routs a packet from a source node, via relay nodes, to a destination node. The nodes are connected by wireless links x. A channel power gain γ is measured for each link x. Resource trade-off curves y=f(x) are constructed for each link x from the channel power gains γ, wherein y represents a set of resources. A hyperbolic upper bound h/x+c is fitted to each resource curve, such that h/x+c≧f(x), wherein h is a scale factor, and c is an offset. A route with an optimal resource allocation is selected according to the hyperbolic upper bounds. Then, the packet is transmitted from the source node to the destination node using the route.
摘要翻译：方法将来自源节点的分组经由中继节点路由到目的地节点。节点通过无线链路x连接。对于每个链路x测量信道功率增益γ。对于来自信道功率增益γ的每个链路x构造资源权衡曲线y = f（x），其中y表示一组资源。双曲线上限h / x + c适合于每个资源曲线，使得h / x +c≥f（x），其中h是比例因子，c是偏移。根据双曲线上限选择具有最佳资源分配的路由。然后，使用该路由从源节点向目的地节点发送分组。

55. 发明授权

US07573933B2 Adaptive delay adjustment for transmitted reference impulse radio systems 失效
标题翻译：发射参考脉冲无线电系统的自适应延迟调整
公开(公告)号：US07573933B2
公开(公告)日：2009-08-11
申请号：US11029135
申请日：2005-01-04
申请人： Andreas F. Molisch , Philip Orlik
发明人： Andreas F. Molisch , Philip Orlik
IPC分类号： H04B1/00
CPC分类号： H04B1/71637 , H04B1/71635 , H04B1/7172 , H04B2201/71636
摘要： A method determines a delay time between reference and data pulses in a time-hopping impulse radio system. Channel state information of a channel between two transceivers is estimated periodically. The delay time frame between the reference and data pulses is then determined according to the channel state information.
摘要翻译：一种方法确定跳时脉冲无线电系统中的参考和数据脉冲之间的延迟时间。周期性地估计两个收发器之间的信道的信道状态信息。然后根据信道状态信息确定参考和数据脉冲之间的延迟时间帧。

56. 发明申请

US20090170458A1 Method and Receiver for Identifying a Leading Edge Time Period in a Received Radio Signal 审中-公开
标题翻译：用于识别接收无线电信号中的前沿时间周期的方法和接收机
公开(公告)号：US20090170458A1
公开(公告)日：2009-07-02
申请号：US11995394
申请日：2005-07-19
申请人： Andreas F. Molisch , Ismail Guvenc , Zafer Sahinoglu
发明人： Andreas F. Molisch , Ismail Guvenc , Zafer Sahinoglu
IPC分类号： H04B17/00
CPC分类号： H04B1/71637 , H04B1/7183
摘要： A method for identifying a leading edge time period of a received radio signal includes identifying a greatest energy time period in a sequence of time periods. The received radio signal has a greatest average energy in the greatest energy time period. The method also includes identifying a least energy time period in the sequence of time periods. The received radio signal has a least average energy in the least energy time period. Further, the method includes setting a threshold energy based on the greatest average energy and the least average energy, determining a number of window time periods based on a characteristic of a radio channel used by the received radio signal, and identifying as a leading edge time period an earliest time period that precedes the greatest energy time period within the number of window time periods. The received radio signal in the leading edge time period has an average energy greater than or equal to the threshold energy.
摘要翻译：一种用于识别所接收的无线电信号的前沿时间段的方法包括识别时间序列中的最大能量时间段。接收的无线电信号在最大能量时间段内具有最大的平均能量。该方法还包括识别时间序列中的最少能量时间段。所接收的无线电信号在最短能量时间段内具有最小平均能量。此外，该方法包括基于最大平均能量和最小平均能量来设置阈值能量，基于由所接收的无线电信号使用的无线电信道的特性确定窗口时间段的数量，以及将其识别为前沿时间期间是在窗口时间段内的最大能量时间段之前的最早时间段。在前沿时间段中接收的无线电信号具有大于或等于阈值能量的平均能量。

57. 发明申请

US20090075590A1 Method and System for Estimating Time of Arrival of Signals Using Multiple Different Time Scales 审中-公开
标题翻译：使用多个不同时间尺度估计信号到达时间的方法和系统
公开(公告)号：US20090075590A1
公开(公告)日：2009-03-19
申请号：US11577106
申请日：2005-04-15
申请人： Zafer Sahinoglu , Ismail Guvenc , Andreas F. Molisch
发明人： Zafer Sahinoglu , Ismail Guvenc , Andreas F. Molisch
IPC分类号： H04B7/24
CPC分类号： H04B1/71637 , G01S5/0221 , G01S13/76 , H04B17/318 , H04B17/336 , H04B17/345
摘要： A method and system (500) estimates a time of arrival of a signal received via a wireless communications channel. The energy in the received signal is conditioned at multiple different time scales to produce a conditioned signal (700). Then, a leading edge is detected in the conditioned signal (550). The leading edge corresponds to the time of arrival of the received signal (551).
摘要翻译：方法和系统（500）估计经由无线通信信道接收的信号的到达时间。接收信号中的能量被调节在多个不同的时标上以产生调节信号（700）。然后，在调节信号（550）中检测前沿。前沿对应于接收信号的到达时间（551）。

58. 发明申请

US20080144562A1 Cooperative Routing in Wireless Networks using Mutual-Information Accumulation 审中-公开
标题翻译：使用相互信息积累的无线网络中的协作路由
公开(公告)号：US20080144562A1
公开(公告)日：2008-06-19
申请号：US12039843
申请日：2008-02-29
申请人： Stark C. Draper , Lingjia Liu , Andreas F. Molisch , Jonathan S. Yedidia
发明人： Stark C. Draper , Lingjia Liu , Andreas F. Molisch , Jonathan S. Yedidia
IPC分类号： H04B7/14 , H04L12/56
CPC分类号： H04B7/2606 , H04B7/026 , H04B7/15592 , H04L1/06 , H04L1/0618 , H04L2001/0092 , H04W52/46
摘要： A route is selected in a wireless cooperative relay network of nodes. A decoding order is initialized. A set of resources is minimized subject to constraints. The resources are allocated to the nodes in the decoding order. The decoding order is changed iteratively to further minimize the allocated resources, until a minimum is reached. A code word is transmitted when the allocated resources are at the minimum, which can either be determined globally or locally at each node. The method can operate in a centralized or distributed manner.
摘要翻译：在节点的无线协作中继网络中选择路由。解码顺序被初始化。一系列资源在受限制的情况下被最小化。资源按解码顺序分配给节点。迭代地改变解码顺序，以进一步最小化分配的资源，直到达到最小值。当分配的资源为最小时，发送码字，这可以在每个节点全局或局部地确定。该方法可以集中或分布式运行。

59. 发明授权

US08054776B2 Multiple power-multiple access in wireless networks for interference cancellation 有权
标题翻译：无线网络中的多功率多重接入用于干扰消除
公开(公告)号：US08054776B2
公开(公告)日：2011-11-08
申请号：US11941170
申请日：2007-11-16
申请人： Andreas F. Molisch , Raymond Yim , Neelesh B. Mehta
发明人： Andreas F. Molisch , Raymond Yim , Neelesh B. Mehta
IPC分类号： H04B7/204 , H04W4/00 , H04L12/43
CPC分类号： H04W52/367 , H04W52/241 , H04W52/50
摘要： A method and network communicate packets by assigning, in each one of a set of multiple transmitters, a power level to a packet to be transmitted during a time interval. The power level is selected from a set of power levels available for the set of multiple transmitters. The power levels in the set range from highest to lowest. There is one packet for each transmitter such that there is a set of packets to be transmitted during the time interval. The set of packets is transmitted concurrently during the time interval to enable decoding of at least one of the packets in the set of packets during the time interval.
摘要翻译：一种方法和网络通过在一组多个发射机中的每一个中分配功率电平到在时间间隔内要发送的分组来传送分组。功率电平是从一组可用于多个发射器的功率电平中选择的。设定范围内的功率级别从最高到最低。每个发射机有一个数据包，使得在时间间隔内有一组要发送的数据包。在时间间隔期间并发传送数据包集合，以便能够在时间间隔期间对该组数据包中的至少一个数据包进行解码。

60. 发明授权

US08040810B2 Method for routing packets in wireless ad-hoc networks with probabilistic delay guarantees 有权
标题翻译：在具有概率延迟保证的无线自组织网络中路由数据包的方法
公开(公告)号：US08040810B2
公开(公告)日：2011-10-18
申请号：US12324673
申请日：2008-11-26
申请人： Matthew Brand , Petar Maymounkov , Andreas F. Molisch
发明人： Matthew Brand , Petar Maymounkov , Andreas F. Molisch
IPC分类号： G01R31/08
CPC分类号： H04W40/02 , H04L45/121
摘要： A method determines an optimal route to deliver a packet from a source node via relay nodes to a destination node in a network. A graph of nodes connected by edges represents possible routes in the network. A probability that the packet arrives at the destination before a deadline time is assigned to each edge. A minimal delay route is selected from the possible routes, and an arrival time for delivering the packet using the minimal delay route is determined. The arrival time is comparing to a deadline time, and the probabilities are scaled accordingly until the minimal delay route is an optimal route.
摘要翻译：一种方法确定了将来自源节点的分组经由中继节点传递到网络中的目的地节点的最佳路由。通过边缘连接的节点图表示网络中的可能路由。分组在最后期限之前到达目的地的概率被分配给每个边缘。从可能的路由中选择最小延迟路由，并且确定使用最小延迟路由传递分组的到达时间。到达时间与截止时间相比较，概率相应地缩放，直到最小延迟路由为最佳路由。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式