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

1. 发明申请

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

2. 发明授权

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.
摘要翻译：一种用于在节点的无线协作中继网络中传送信息的系统和方法，所述节点包括源，一组中继和目的地。源使用无码代码广播编码为数据流的码字。继电器接收数据流，解码数据流以恢复代码字，并重新编码并发送恢复的代码字作为数据流与无码代码。目的地接收并解码重新编码的数据流以恢复码字。

3. 发明申请

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.
摘要翻译：方法选择节点的无线协作中继网络中的路由，节点包括源，一组中继和目的地。码字被编码为数据流。数据流通过一组中继从源传送到目的地。在特定节点处累积相互信息以解码数据流并恢复码字。然后，在发送和累加的同时，基于节点之间的信道状态信息来选择从源到目的地的路由。

4. 发明授权

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.
摘要翻译：一种方法编码将通过无线信道发送的输入比特块序列。每个输入比特块被转换成码字，并将每个码字映射到复数的多个子块。将每个子块乘以去歧义扩展变换，以获得可以被调制并发送到接收机的变换符号的子块，其中每个接收块被解调成一个复数块，块。复数子块被转换成对应于解码码字的似然比集合。即使只有一个对应于输入比特块的符号块中的一个被正确地接收，输入比特可被明确地解码。

5. 发明授权

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.
摘要翻译：方法选择节点的无线协作中继网络中的路由，节点包括源，一组中继和目的地。码字被编码为数据流。数据流通过一组中继从源传送到目的地。在特定节点处累积相互信息以解码数据流并恢复码字。然后，在发送和累加的同时，基于节点之间的信道状态信息来选择从源到目的地的路由。

6. 发明申请

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.
摘要翻译：一种方法构建代码，其中代码是大环准循环低密度奇偶校验码。为代码选择基本矩阵。确定与基本矩阵相对应的成本矩阵。基地中的单个元素反复更改最大化成本降低。当成本为零时，从基本矩阵构建奇偶校验矩阵，并且使用编码器中的奇偶校验矩阵将信息块编码为码字。

7. 发明申请

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.

8. 发明授权

US07779268B2 Biometric based user authentication and data encryption 有权
标题翻译：基于生物特征的用户认证和数据加密
公开(公告)号：US07779268B2
公开(公告)日：2010-08-17
申请号：US11564638
申请日：2006-11-29
申请人： Stark C. Draper , Ashish Khisti , Emin Martinian , Anthony Vetro , Jonathan S. Yedidia
发明人： Stark C. Draper , Ashish Khisti , Emin Martinian , Anthony Vetro , Jonathan S. Yedidia
IPC分类号： G06F7/00 , G06F7/04 , G06F21/00
CPC分类号： G06K9/00885 , G06K9/00073 , H04L9/3231 , H04L9/3236
摘要： Biometric parameters acquired from human forces, voices, fingerprints, and irises are used for user authentication and access control. Because the biometric parameters are continuous and vary from one reading to the next, syndrome codes are applied to determine biometric syndrome vectors. The biometric syndrome vectors can be stored securely while tolerating an inherent variability of biometric data. The stored biometric syndrome vector is decoded during user authentication using biometric parameters acquired at that time. The syndrome codes can also be used to encrypt and decrypt data.
摘要翻译：从人力，语音，指纹和鸢尾获得的生物特征参数用于用户认证和访问控制。因为生物特征参数是连续的，并且从一个读数变化到下一个读数，所以应用校正子码来确定生物特征综合征矢量。可以安全地存储生物特征综合征矢量，同时容忍生物特征数据的固有变异性。存储的生物统计量子载体在用户认证期间使用当时获取的生物特征参数进行解码。校正码也可用于加密和解密数据。

9. 发明授权

US08261170B2 Multi-stage decoder for error-correcting codes 有权
标题翻译：用于纠错码的多级解码器
公开(公告)号：US08261170B2
公开(公告)日：2012-09-04
申请号：US12360832
申请日：2009-01-27
申请人： Jonathan S. Yedidia , Yige Wang , Stark C. Draper
发明人： Jonathan S. Yedidia , Yige Wang , Stark C. Draper
IPC分类号： H03M13/03
CPC分类号： H04L1/0053 , H03M13/1108 , H03M13/1111 , H03M13/112 , H03M13/1194 , H03M13/2957 , H03M13/3707 , H03M13/3761 , H03M13/45 , H03M13/6577 , H03M13/658 , H04L1/005
摘要： A multi-stage decoder decodes a block of symbols, received via a noisy channel, to a codeword. The decoder includes multiple sub-decoders connected sequentially, and wherein a next sub-decoder has a slower processing time and better word error rate than a previous sub-decoder, and wherein the next sub-decoder is only executed if the previous decoder fails to decode the block sequence of symbols, and a last sub-decoder is executed until a termination condition is reached.
摘要翻译：多级解码器将经由噪声信道接收到的符号块解码为码字。解码器包括顺序连接的多个子解码器，并且其中下一个子解码器具有比先前的子解码器更慢的处理时间和更好的字错误率，并且其中下一个子解码器仅在先前的解码器不能对符号的块序列进行解码，并且执行最后一个子解码器直到达到终止条件。

10. 发明申请

US20080316069A1 Maximum Likelihood Decoding via Mixed-Integer Adaptive Linear Programming 有权
标题翻译：通过混合整数自适应线性规划的最大似然解码
公开(公告)号：US20080316069A1
公开(公告)日：2008-12-25
申请号：US11764938
申请日：2007-06-19
申请人： Stark C. Draper , Jonathan S. Yedidia
发明人： Stark C. Draper , Jonathan S. Yedidia
IPC分类号： H03M7/38
CPC分类号： H03M13/1105 , H03M13/37 , H03M13/451 , H03M13/458
摘要： A method and system decodes a sequence of symbols received via a channel to a codeword of an error-correcting code. Log-likelihood ratios are determined from a sequence of symbols received via a channel. A set of constraints is initialized according to the log-likelihood ratios. An adaptive linear programming decoder is applied to the set of constraints and the log-likelihood ratios according to an error-correcting code to produce an estimate of the codeword and an updated set of constraints. If the estimate of the codeword is a non-integer pseudo codeword, further update the set of updated constraints with a set of integer constraints if the estimate of the codeword is the non-integer pseudo codeword, and proceeding with the applying step, and otherwise producing the estimate of the codeword as the final codeword.
摘要翻译：方法和系统将经由信道接收的符号序列解码为纠错码的码字。从通过信道接收的符号序列确定对数似然比。根据对数似然比初始化一组约束。根据纠错码将自适应线性规划解码器应用于约束集和对数似然比，以产生码字的估计和更新的约束集合。如果码字的估计是非整数伪码字，则如果码字的估计是非整数伪码字，并进行应用步骤，则用一组整数约束进一步更新更新的约束集合，否则产生码字的估计作为最终码字。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式