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

1. 发明授权

US07673219B2 Cooperative relay networks using rateless codes 失效
标题翻译：使用无码代码的合作中继网络
公开(公告)号：US07673219B2
公开(公告)日：2010-03-02
申请号：US11377711
申请日：2006-03-16
申请人： Andreas F. Molisch , Neelesh B. Mehta , Jonathan S. Yedidia , Jinyun Zhang
发明人： Andreas F. Molisch , Neelesh B. Mehta , Jonathan S. Yedidia , Jinyun Zhang
IPC分类号： G11C29/00
CPC分类号： H04B7/026 , H04B7/15592 , H04L1/06 , H04L1/0618 , H04L2001/0097 , H04W52/46
摘要： A system and method for communicating information in a wireless cooperative relay network of nodes, the nodes including a source, a set of relays, and a destination. The source broadcasts a code word encoded as a data stream using a rateless code. The relays receive the data stream, decode the data stream to recover the code word, and reencode and transmit the recovered code word as the data stream with the rateless code. The destination receives and decodes the reencoded data streams to recover the code word.
摘要翻译：一种用于在节点的无线协作中继网络中传送信息的系统和方法，所述节点包括源，一组中继和目的地。源使用无码代码广播编码为数据流的码字。继电器接收数据流，解码数据流以恢复代码字，并重新编码并发送恢复的代码字作为数据流与无码代码。目的地接收并解码重新编码的数据流以恢复码字。

2. 发明申请

US20080144512A1 Route Selection in Cooperative Relay Networks 有权
标题翻译：合作中继网络中的路由选择
公开(公告)号：US20080144512A1
公开(公告)日：2008-06-19
申请号：US11566846
申请日：2006-12-05
申请人： Andreas F. Molisch , Neelesh B. Mehta , Jonathan S. Yedidia , Zhifeng Tao , Zafer Sahinoglu , Philip V. Orlik , Jin Zhang
发明人： Andreas F. Molisch , Neelesh B. Mehta , Jonathan S. Yedidia , Zhifeng Tao , Zafer Sahinoglu , Philip V. Orlik , Jin Zhang
IPC分类号： H04J3/14
CPC分类号： H04B7/026 , H04B7/15592 , H04B7/2606 , H04L1/06 , H04L1/0618 , H04L2001/0092 , H04W52/46
摘要： A method selects a route in a wireless cooperative relay network of nodes, the nodes including a source, a set of relays, and a destination. A codeword is encoded as a data stream. The data stream is transmitted from a source to a destination via a set of relays. Mutual information is accumulated at a particular node to decode the data stream and recover the codeword. Then, a route from the source to the destination is selected based on channel state information between the nodes while transmitting and accumulating.
摘要翻译：方法选择节点的无线协作中继网络中的路由，节点包括源，一组中继和目的地。码字被编码为数据流。数据流通过一组中继从源传送到目的地。在特定节点处累积相互信息以解码数据流并恢复码字。然后，在发送和累加的同时，基于节点之间的信道状态信息来选择从源到目的地的路由。

3. 发明授权

US07593342B2 Route selection in cooperative relay networks 有权
标题翻译：协作中继网络路由选择
公开(公告)号：US07593342B2
公开(公告)日：2009-09-22
申请号：US11566846
申请日：2006-12-05
申请人： Andreas F. Molisch , Neelesh B. Mehta , Jonathan S. Yedidia , Zhifeng Tao , Zafer Sahinoglu , Philip V. Orlik , Jin Zhang
发明人： Andreas F. Molisch , Neelesh B. Mehta , Jonathan S. Yedidia , Zhifeng Tao , Zafer Sahinoglu , Philip V. Orlik , Jin Zhang
IPC分类号： G01R31/08
CPC分类号： H04B7/026 , H04B7/15592 , H04B7/2606 , H04L1/06 , H04L1/0618 , H04L2001/0092 , H04W52/46
摘要： A method selects a route in a wireless cooperative relay network of nodes, the nodes including a source, a set of relays, and a destination. A codeword is encoded as a data stream. The data stream is transmitted from a source to a destination via a set of relays. Mutual information is accumulated at a particular node to decode the data stream and recover the codeword. Then, a route from the source to the destination is selected based on channel state information between the nodes while transmitting and accumulating.
摘要翻译：方法选择节点的无线协作中继网络中的路由，节点包括源，一组中继和目的地。码字被编码为数据流。数据流通过一组中继从源传送到目的地。在特定节点处累积相互信息以解码数据流并恢复码字。然后，在发送和累加的同时，基于节点之间的信道状态信息来选择从源到目的地的路由。

4. 发明申请

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.
摘要翻译：在节点的无线协作中继网络中选择路由。解码顺序被初始化。一系列资源在受限制的情况下被最小化。资源按解码顺序分配给节点。迭代地改变解码顺序，以进一步最小化分配的资源，直到达到最小值。当分配的资源为最小时，发送码字，这可以在每个节点全局或局部地确定。该方法可以集中或分布式运行。

5. 发明授权

US07376173B2 Unambiguously encoding and decoding signals for wireless channels 失效
标题翻译：明确地编码和解码无线信道的信号
公开(公告)号：US07376173B2
公开(公告)日：2008-05-20
申请号：US10950772
申请日：2004-09-27
申请人： Jonathan S. Yedidia , Andreas F. Molisch , Karunakar Pedagani
发明人： Jonathan S. Yedidia , Andreas F. Molisch , Karunakar Pedagani
IPC分类号： H04B1/00
CPC分类号： H04L5/0026 , H04L25/067 , H04L27/0008 , H04L27/2035 , H04L27/206
摘要： A method encodes a sequence of blocks of input bits to be transmitted over a wireless channel. Each block of input bits is converted to a codeword, and each codeword is mapped to multiple sub-blocks of complex numbers. Each sub-block is multiplied by a disambiguating spreading transform to obtain a sub-block of transformed symbols, which can be modulated and transmitted to a receiver, where each received block is demodulated to a block of complex numbers, which are partitioned into sub-blocks. The sub-block of complex numbers are converted to a set of likelihood ratios that correspond to decoded codewords. The input bits can be decoded unambiguously even if only one of the blocks of symbols corresponding to the block of input bits is received correctly.
摘要翻译：一种方法编码将通过无线信道发送的输入比特块序列。每个输入比特块被转换成码字，并将每个码字映射到复数的多个子块。将每个子块乘以去歧义扩展变换，以获得可以被调制并发送到接收机的变换符号的子块，其中每个接收块被解调成一个复数块，块。复数子块被转换成对应于解码码字的似然比集合。即使只有一个对应于输入比特块的符号块中的一个被正确地接收，输入比特可被明确地解码。

6. 发明授权

US08495379B2 Method and system for managing a hierarchy of passwords 失效
标题翻译：用于管理密码层级的方法和系统
公开(公告)号：US08495379B2
公开(公告)日：2013-07-23
申请号：US12357801
申请日：2009-01-22
申请人： Shantanu Rane , Yige Wang , Jonathan S. Yedidia , Anthony Vetro
发明人： Shantanu Rane , Yige Wang , Jonathan S. Yedidia , Anthony Vetro
IPC分类号： G06F21/00
CPC分类号： H04L9/3247 , H04L9/0836 , H04L9/0894 , H04L9/3226 , H04L9/3236 , H04L2209/34
摘要： A method and system manage a hierarchy of passwords for users accessing a hierarchy of access control devices. First, a codeword is acquired and a syndrome of the codeword is determined. Next, the codeword is randomly modified with a probability p to produce a modified codeword. The modified codeword is selected and assigned to a user as a password, if the modified codeword is recoverable.
摘要翻译：一种方法和系统管理访问访问控制设备的层次结构的用户的密码层级。首先，获取码字并确定码字的校正子。接下来，以概率p随机修改码字以产生修改后的码字。如果修改的码字是可恢复的，则修改的码字被选择并分配给用户作为密码。

7. 发明申请

US20100185870A1 Method and System for Managing a Hierarchy of Passwords 失效
标题翻译：管理密码层次的方法和系统
公开(公告)号：US20100185870A1
公开(公告)日：2010-07-22
申请号：US12357801
申请日：2009-01-22
申请人： Shantanu Rane , Yige Wang , Jonathan S. Yedidia , Anthony Vetro
发明人： Shantanu Rane , Yige Wang , Jonathan S. Yedidia , Anthony Vetro
IPC分类号： H04L9/32
CPC分类号： H04L9/3247 , H04L9/0836 , H04L9/0894 , H04L9/3226 , H04L9/3236 , H04L2209/34
摘要： A method and system manage a hierarchy of passwords for users accessing a hierarchy of access control devices. First, a codeword is acquired and a syndrome of the codeword is determined. Next, the codeword is randomly modified with a probability p to produce a modified codeword. The modified codeword is selected and assigned to a user as a password, if the modified codeword is recoverable.
摘要翻译：一种方法和系统管理访问访问控制设备的层次结构的用户的密码层级。首先，获取码字并确定码字的校正子。接下来，以概率p随机修改码字以产生修改后的码字。如果修改的码字是可恢复的，则修改的码字被选择并分配给用户作为密码。

8. 发明申请

US20100058139A1 Method for constructing large-girth quasi-cyclic low-density parity-check codes 有权
标题翻译：构建大环准循环低密度奇偶校验码的方法
公开(公告)号：US20100058139A1
公开(公告)日：2010-03-04
申请号：US12199512
申请日：2008-08-27
申请人： Yige Wang , Jonathan S. Yedidia , Stark C. Draper
发明人： Yige Wang , Jonathan S. Yedidia , Stark C. Draper
IPC分类号： H03M13/11 , G06F11/10
CPC分类号： H03M13/116 , H03M13/033
摘要： A method constructs a code, wherein the code is a large-girth quasi-cyclic low-density parity-check code. A base matrix is selected for the code. A cost matrix corresponding to the base matrix is determined. A single element in the base is changed repeatedly maximize a reduction in cost. A parity check matrix is constructing for the code from the base matrix when the cost is zero, and an information block is encoded as a code word using the parity check matrix in an encoder.
摘要翻译：一种方法构建代码，其中代码是大环准循环低密度奇偶校验码。为代码选择基本矩阵。确定与基本矩阵相对应的成本矩阵。基地中的单个元素反复更改最大化成本降低。当成本为零时，从基本矩阵构建奇偶校验矩阵，并且使用编码器中的奇偶校验矩阵将信息块编码为码字。

9. 发明授权

US06910000B1 Generalized belief propagation for probabilistic systems 有权
标题翻译：概率系统的广义信念传播
公开(公告)号：US06910000B1
公开(公告)日：2005-06-21
申请号：US09586282
申请日：2000-06-02
申请人： Jonathan S. Yedidia , William T. Freeman
发明人： Jonathan S. Yedidia , William T. Freeman
IPC分类号： G06F19/00 , G06F17/10 , G06F17/18
CPC分类号： G06F17/10
摘要： A method determines approximate probabilities of states of a system represented by a model. The model includes nodes connected by links. Each node represents possible states of a corresponding part of the system, and each link represents statistical dependencies between possible states of related nodes. The nodes are grouped into arbitrary sized clusters such that every node is included in at least one cluster and each link is completely contained in at least one cluster. Messages, based on the arbitrary sized cluster, are defined. Each message has associated sets of source nodes and destination nodes, and a value and a rule depending on other messages and on selected links connecting the source nodes and destination nodes. The value of each message is updated until a termination condition is reached. When the termination condition is reached, approximate probabilities of the states of the system are determined from the values of the messages.
摘要翻译：一种方法确定由模型表示的系统的状态的近似概率。该模型包括通过链接连接的节点。每个节点表示系统的对应部分的可能状态，并且每个链路表示相关节点的可能状态之间的统计依赖性。节点被分组成任意大小的集群，使得每个节点被包括在至少一个集群中，并且每个链路完全包含在至少一个集群中。定义了基于任意大小的集群的消息。每个消息具有关联的源节点和目的节点集合，以及取决于其他消息的值和规则，以及连接源节点和目的节点的选定链路。每个消息的值被更新，直到达到终止条件。当达到终止条件时，根据消息的值确定系统的状态的近似概率。

10. 发明申请

US20110041029A1 Method and System for Decoding Graph-Based Codes Using Message-Passing with Difference-Map Dynamics 有权
公开(公告)号：US20110041029A1
公开(公告)日：2011-02-17
申请号：US12541810
申请日：2009-08-14
申请人： Jonathan S. Yedidia , Yige Wang , Stark C. Draper
发明人： Jonathan S. Yedidia , Yige Wang , Stark C. Draper
IPC分类号： H03M13/05 , G06F11/10
CPC分类号： G06F7/5057 , G06F7/5443 , H03M13/1111 , H03M13/658 , H04B10/6165 , H04L9/3218 , H04L2209/46 , H04L2209/50
摘要： A code to be decoded by message-passing is represented by a factor graph. The factor graph includes variable nodes indexed by i and constraint nodes indexed by a connected by edges for transferring messages mi→a outgoing from the variable nodes to the constraint nodes and messages ma→i incoming from the constraint nodes to the variable nodes. The messages mi→a are initialized based on beliefs bi of a received codeword. The messages ma→i are generated by overshooting the messages mi→a at the constraint nodes. The beliefs bi are updated at the variable nodes using the messages ma→i. The codeword is outputted if found, otherwise, the messages mi→a are updated using a correction for the overshooting.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式