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

1. 发明申请

US20070213066A1 Controlling base station router device definition codes 有权
标题翻译：控制基站路由器设备定义码
公开(公告)号：US20070213066A1
公开(公告)日：2007-09-13
申请号：US11371636
申请日：2006-03-09
申请人： Holger Claussen , Lester Wee Ho , Hamid Karimi , Louis Samuel
发明人： Holger Claussen , Lester Wee Ho , Hamid Karimi , Louis Samuel
IPC分类号： H04Q7/20
CPC分类号： H04W8/26 , H04W16/16
摘要： A wireless communication system (20) allows for using base station router devices (30, 32) for in building communications using a mobile station (22). Automatically configuring a definition code such as primary scrambling codes or pseudo random noise offsets of the base station router devices (30, 32) facilitates minimizing or avoiding false handovers between a macrocell base station (24) and one of the base station router devices (30, 32). In a disclosed example, a controller (26) such as a radio network controller communicates with at least one of the base station router devices (30, 32) for automatically changing a definition code used by such a device to avoid correspondence between definition codes within a selected range.
摘要翻译：无线通信系统（20）允许使用基站路由器设备（30,32）来建立使用移动站（22）的通信。自动配置诸如基站路由器设备（30,32）的主扰码或伪随机噪声偏移的定义代码有助于最小化或避免宏蜂窝基站（24）与基站路由器设备（30）之一之间的错误切换，32）。在公开的示例中，诸如无线电网络控制器的控制器（26）与基站路由器设备（30,32）中的至少一个通信，用于自动地改变由这样的设备使用的定义码，以避免在此之内的定义码之间的对应一个选定的范围。

2. 发明申请

US20070264940A1 Method of managing interference in a wireless communication system 有权
标题翻译：管理无线通信系统中的干扰的方法
公开(公告)号：US20070264940A1
公开(公告)日：2007-11-15
申请号：US11431271
申请日：2006-05-10
申请人： Lester Ho , Hamid Karimi , Holger Claussen , Louis Samuel
发明人： Lester Ho , Hamid Karimi , Holger Claussen , Louis Samuel
IPC分类号： H04B17/00
CPC分类号： H04W72/082 , H04B1/10 , H04W74/085
摘要： The present invention provides methods of managing interference in a wireless communication system. The methods may include receiving information indicative of a portion of an interfering signal received by a first wireless communication device, decoding the portion of the interfering signal, and providing at least one back-off instruction destined for a second wireless communication device based on the decoded portion of the interfering signal.
摘要翻译：本发明提供了一种管理无线通信系统中的干扰的方法。所述方法可以包括接收指示由第一无线通信设备接收的干扰信号的一部分的信息，对干扰信号的该部分进行解码，以及基于解码后的第二无线通信设备提供至少一个指向第二无线通信设备的退避指令部分干扰信号。

3. 发明申请

US20070213086A1 Automatically configuring a neighbor set for a base station 有权
标题翻译：自动配置基站的邻居集
公开(公告)号：US20070213086A1
公开(公告)日：2007-09-13
申请号：US11371637
申请日：2006-03-09
申请人： Holger Claussen , Lester Ho , Hamid Karimi , Louis Samuel
发明人： Holger Claussen , Lester Ho , Hamid Karimi , Louis Samuel
IPC分类号： H04B7/00
CPC分类号： H04W16/18
摘要： An automated technique for configuring a neighbor set for a base station (32) includes initializing the neighbor set based upon reported measurements from a mobile station (22). In a disclosed example, a newly installed base station (32) transmits a cell information list to a mobile station (22) requesting measurement reports regarding a plurality of candidate base station identifiers. Based upon the reported measurements, a determination is made regarding which of the base stations should be included in the neighbor set for the base station (32). A disclosed example includes the capability of automatically initializing the neighbor set and automatically updating the set. Disclosed examples include utilizing information from a plurality of mobile stations.
摘要翻译：用于配置用于基站（32）的邻居集合的自动化技术包括基于来自移动站（22）的报告的测量来初始化邻居集合。在公开的示例中，新安装的基站（32）向移动台（22）发送小区信息列表，请求关于多个候选基站标识符的测量报告。基于所报告的测量，确定关于哪些基站应包括在用于基站（32）的相邻集合中。所公开的示例包括自动初始化邻居集合并自动更新该集合的能力。公开的示例包括利用来自多个移动站的信息。

4. 发明申请

US20050031053A1 Decoding method and apparatus 失效
标题翻译：解码方法和装置
公开(公告)号：US20050031053A1
公开(公告)日：2005-02-10
申请号：US10637788
申请日：2003-08-08
申请人： Holger Claussen , Hamid Karimi
发明人： Holger Claussen , Hamid Karimi
IPC分类号： H03M13/29 , H03M13/39 , H03M13/45 , H04L1/00 , H04L27/06
CPC分类号： H03M13/3905 , H03M13/2957 , H03M13/658
摘要： A method of decoding is provided comprising processing iterations. In each processing iteration, there is a first Max-Log-MAP decoding operation giving rise to a systematic error due to the Max-Log approximation, and a first weighting operation to weight extrinsic information from the first decoding operation to be applied as a priori information to the second Max-Log-MAP decoding operation. This is followed by a second Max-Log-MAP decoding operation, also giving rise to a systematic error due to the Max-Log approximation, and a second weighting operation to weight extrinsic information from the second decoding to be applied as a priori information to the first Max-Log-MAP decoding of the next iteration. The weights are applied to compensate for the systematic error due to the Max-Log approximation made in the last Max-Log-MAP decoding operation.
摘要翻译：提供一种解码方法，包括处理迭代。在每个处理迭代中，存在由于Max-Log近似而引起系统误差的第一Max-Log-MAP解码操作，以及用于对来自第一解码操作的外在信息加权作为先验加权的第一加权操作信息到第二次Max-Log-MAP解码操作。之后是第二次Max-Log-MAP解码操作，也由于Max-Log近似而引起系统误差，以及第二加权操作，用于将来自第二解码的外在信息加权作为先验信息应用于第一次Max-Log-MAP解码的下一次迭代。应用权重来补偿由于在最后的Max-Log-MAP解码操作中进行的Max-Log近似而导致的系统误差。

5. 发明授权

US07756631B2 Method for realtime scaling of the vehicle routing problem 有权
标题翻译：实时缩放车辆路线问题的方法
公开(公告)号：US07756631B2
公开(公告)日：2010-07-13
申请号：US11513875
申请日：2006-08-31
申请人： Marcos D. Chavira , Hamid Karimi , Carolyn B. Boettcher
发明人： Marcos D. Chavira , Hamid Karimi , Carolyn B. Boettcher
IPC分类号： G05D1/00
CPC分类号： G01C21/00
摘要： An absolutely optimal routing or a quasi-optimal routing is computed for a first plurality of resources m to be routed to a second plurality of resource destinations n, depending on a count of m and n. Three different algorithms are used. For the case where the count is m≦6 and n≦8, a first algorithm is used to arrive at an absolutely optimal routing. An example of the first algorithm is Depth First Branch and Bound Search. For a second count, where the value of the count is more numerous than the first count, m is greater than six, but equal to, or less than or equal to fifty, 6 50, and n>100. An example of this third algorithm is Swarming.
摘要翻译：根据m和n的计数，针对待路由到第二多个资源目的地n的第一多个资源m计算绝对最佳路由或准最优路由。使用三种不同的算法。对于计数为m＆nlE; 6和n＆nlE; 8的情况，第一种算法用于获得绝对最优路由。第一种算法的一个例子是深度优先分支和绑定搜索。对于第二计数，其中计数的值比第一计数多，m大于6，但等于或小于或等于五十，六，六，五，并且n大于8，但小于或等于百分之八十，第二种算法用于计算准最优路由。第二种算法的一个例子是Local Search。对于计数超过上述计数的第三计数，第三种算法用于计算准最优路由。通常，第三种算法适用于m> 50且n> 100。第三种算法的一个例子是Swarming。

6. 发明申请

US20080059056A1 Method for realtime scaling of the vehicle routing problem 有权
标题翻译：实时缩放车辆路线问题的方法
公开(公告)号：US20080059056A1
公开(公告)日：2008-03-06
申请号：US11513875
申请日：2006-08-31
申请人： Marcos D. Chavira , Hamid Karimi , Carolyn B. Boettcher
发明人： Marcos D. Chavira , Hamid Karimi , Carolyn B. Boettcher
IPC分类号： G01C21/00
CPC分类号： G01C21/00
摘要： An absolutely optimal routing or a quasi-optimal routing is computed for a first plurality of resources m to be routed to a second plurality of resource destinations n, depending on a count of m and n. Three different algorithms are used. For the case where the count is m≦6 and n≦8, a first algorithm is used to arrive at an absolutely optimal routing. An example of the first algorithm is Depth First Branch and Bound Search. For a second count, where the value of the count is more numerous than the first count, m is greater than six, but equal to, or less than or equal to fifty, 6 50, and n>100. An example of this third algorithm is Swarming.
摘要翻译：根据m和n的计数，针对待路由到第二多个资源目的地n的第一多个资源m计算绝对最佳路由或准最优路由。使用三种不同的算法。对于计数为m <= 6且n <= 8的情况，使用第一算法来获得绝对最优路由。第一种算法的一个例子是深度优先分支和绑定搜索。对于第二计数，其中计数的值比第一计数多，m大于6，但等于或小于或等于五十六 50且n> 100。第三种算法的一个例子是Swarming。

7. 发明申请

US20060109814A1 Communicating data between an access point and multiple wireless devices over a link 有权
公开(公告)号：US20060109814A1
公开(公告)日：2006-05-25
申请号：US10996617
申请日：2004-11-24
申请人： Alexandr Kuzminskiy , Hamid Karimi , Kin Leung
发明人： Alexandr Kuzminskiy , Hamid Karimi , Kin Leung
IPC分类号： H04Q7/00 , H04B3/10
CPC分类号： H04L1/1692 , H04B7/0408 , H04W16/28 , H04W80/00 , H04W84/12
摘要： The present invention provides a method and an apparatus for communicating data over a network between a communication node, for example, an access point having a first and a second antenna and a first and a second mobile station. The method comprises weighting a first data at the access point to transmit the first data using the first and second antennas so that the first mobile station only receives the first data and weighting a second data at the access point to transmit the second data using the first and second antennas so that the second mobile station only receives the second data. A space division multiple access (SDMA) module may cause a transmission protocol to transmit the first data to the first mobile station on the downlink and transmit the second data to the second mobile station in parallel to the transmission of the first data on the downlink. In a telecommunication system, this substantially simultaneous transmission of the first and second data using a similar carrier frequency in a radio frequency communication over a wireless local area network (WLAN) may increase throughput of a downlink, for example, by a factor nominally equal to the number of antennas at an access point.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式