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

81. 发明申请

US20120113984A1 MULTI-STAGE INTERCONNECTION NETWORKS HAVING SMALLER MEMORY REQUIREMENTS 有权
标题翻译：具有较小内存要求的多级互连网络
公开(公告)号：US20120113984A1
公开(公告)日：2012-05-10
申请号：US12942125
申请日：2010-11-09
申请人： Kiran Gunnam
发明人： Kiran Gunnam
IPC分类号： H04L12/50
CPC分类号： H04L49/1507
摘要： In one embodiment, a multistage interconnection network (MIN) has two or more configurable stages, each stage having a plurality of switches. The network has one or more unused input terminals, each mapped using fixed switch connections to an unused output terminal. The network also has a set of used input terminals that are selectively mapped to a set of used output terminals based on values of control signals supplied to the stages. Each stage receives a different control signal, and each control signal is generated by cyclically shifting a control seed by a corresponding cyclic-shift value. Fixing the mappings of the unused terminals ensures that the used input terminals are not mapped to any unused output terminals. By storing only the control seed, memory requirements are reduced over networks that explicitly store individual control signals for all of the stages.
摘要翻译：在一个实施例中，多级互连网络（MIN）具有两个或多个可配置级，每个级具有多个开关。网络具有一个或多个未使用的输入端子，每个使用的输入端子使用固定的开关连接映射到未使用的输出端子。网络还具有一组使用的输入端子，其基于提供给级的控制信号的值被选择性地映射到一组使用的输出端子。每个级接收不同的控制信号，并且通过将控制种子循环移位相应的循环移位值来产生每个控制信号。固定未使用终端的映射确保所使用的输入端子未映射到任何未使用的输出端子。通过仅存储控制种子，通过明确存储所有级的各个控制信号的网络来减少存储器要求。

82. 发明申请

US20120005552A1 ON-LINE DISCOVERY AND FILTERING OF TRAPPING SETS 有权
标题翻译：在线发现和过滤器
公开(公告)号：US20120005552A1
公开(公告)日：2012-01-05
申请号：US12829426
申请日：2010-07-02
申请人： Kiran Gunnam
发明人： Kiran Gunnam
IPC分类号： H03M13/05 , G06F11/10
CPC分类号： H03M13/1142 , G11B2020/185 , G11B2220/2516
摘要： A communication system (e.g., a hard drive) having a random-access memory (RAM) for storing trapping-set (TS) information that the communication system generates on-line during a special operating mode, in which low-density parity-check (LDPC)-encoded test codewords are written to a storage medium and then read and decoded to discover trapping sets that appear in candidate codewords produced by an LDPC decoder during decoding iterations. The discovered trapping sets are filtered to select a subset of trapping sets that satisfy specified criteria. The discovery and filtering of trapping sets is performed based on error vectors that are calculated using the a priori knowledge of original test codewords. The TS information corresponding to the selected subset is stored in the RAM and accessed as may be necessary to break the trapping sets that appear in candidate codewords produced by the LDPC decoder during normal operation of the communication system.
摘要翻译：具有随机存取存储器（RAM）的通信系统（例如，硬盘驱动器），用于存储通信系统在特殊操作模式期间在线生成的捕获集（TS）信息，其中低密度奇偶校验（LDPC）编码的测试码字被写入存储介质，然后读取和解码，以发现在解码迭代期间由LDPC解码器产生的候选码字中出现的捕获集合。已发现的捕获集被过滤以选择满足指定标准的捕获集合的子集。捕获集合的发现和过滤基于使用原始测试码字的先验知识计算的误差向量来执行。对应于所选择的子集的TS信息被存储在RAM中并且可能需要进行存取，以便在通信系统的正常操作期间破坏由LDPC解码器产生的候选码字中出现的捕获集合。

83. 发明授权

US08044832B1 Interleaver for turbo equalization 有权
公开(公告)号：US08044832B1
公开(公告)日：2011-10-25
申请号：US13038141
申请日：2011-03-01
申请人： Yifei Zhang , Kiran Gunnam , Gregory Burd
发明人： Yifei Zhang , Kiran Gunnam , Gregory Burd
IPC分类号： H03M7/00
CPC分类号： H03M13/2782 , H03M13/1102 , H03M13/116 , H03M13/2707 , H03M13/2742 , H03M13/2957 , H03M13/6325
摘要： A plurality of “local” interleavers replaces a single global interleaver for processing encoded data. If the encoded data may be represented as a matrix of data blocks, or “circulants,” each local interleaver can be the size of one or a small number of circulants. Thus, for example, if the matrix has a certain number of rows and columns, the number of local interleavers may be equal to the number of columns. Each local interleaver is small so latency is low.

84. 发明授权

US07911364B1 Interleaver for turbo equalization 有权
标题翻译：交换机用于涡轮均衡
公开(公告)号：US07911364B1
公开(公告)日：2011-03-22
申请号：US12203691
申请日：2008-09-03
申请人： Yifei Zhang , Kiran Gunnam , Gregory Burd
发明人： Yifei Zhang , Kiran Gunnam , Gregory Burd
IPC分类号： H03M7/00
CPC分类号： H03M13/2782 , H03M13/1102 , H03M13/116 , H03M13/2707 , H03M13/2742 , H03M13/2957 , H03M13/6325
摘要： A plurality of “local” interleavers replaces a single global interleaver for processing encoded data. If the encoded data may be represented as a matrix of data blocks, or “circulants,” each local interleaver can be the size of one or a small number of circulants. Thus, for example, if the matrix has a certain number of rows and columns, the number of local interleavers may be equal to the number of columns. Each local interleaver is small so latency is low.
摘要翻译：多个“本地”交织器替换单个全局交织器来处理编码数据。如果编码数据可以表示为数据块或“循环”的矩阵，则每个局部交织器可以是一个或少数循环的大小。因此，例如，如果矩阵具有一定数量的行和列，则本地交织器的数量可以等于列数。每个局部交织器都很小，所以延迟很低。

85. 发明申请

US20100042895A1 SELECTING LAYERED-DECODING SCHEDULES FOR OFFLINE TESTING 有权
标题翻译：选择离线测试的层次解码时间表
公开(公告)号：US20100042895A1
公开(公告)日：2010-02-18
申请号：US12510667
申请日：2009-07-28
申请人： Kiran Gunnam
发明人： Kiran Gunnam
IPC分类号： H03M13/05 , G06F11/10
CPC分类号： H03M13/1111 , H03M13/09 , H03M13/1142 , H03M13/3707 , H03M13/3738 , H03M13/3753 , H03M13/451
摘要： A method for selecting a population of schedules of an n-layer decoder for offline schedule testing. The method identifies one or more triads, where a triad is a sequence of three layers where no layer is repeated. The method selects a set of schedules where each of the identified triads is contained in at least one schedule. The method associates each selected schedule with one or more key-layer values, where a key layer is the middle layer of a triad contained within the schedule.
摘要翻译：一种用于选择用于离线时间表测试的n层解码器的时间表种群的方法。该方法识别一个或多个三元组，其中三元组是不重复层的三层序列。该方法选择一组时间表，其中每个所识别的三元组包含在至少一个调度中。该方法将每个选定的日程表与一个或多个密钥层值相关联，其中密钥层是包含在日程表内的三元组的中间层。

86. 发明申请

US20100042806A1 DETERMINING INDEX VALUES FOR BITS OF A BINARY VECTOR 有权
标题翻译：确定二进制矢量的位置的索引值
公开(公告)号：US20100042806A1
公开(公告)日：2010-02-18
申请号：US12333840
申请日：2008-12-12
申请人： Kiran Gunnam
发明人： Kiran Gunnam
IPC分类号： G06F15/76 , G06F7/32
CPC分类号： G06F7/607
摘要： In one embodiment, the present invention determines index values corresponding to bits of a binary vector that have a value of 1. During each clock cycle, a masking technique is applied to M sub-vector index values, where each sub-vector index value corresponds to a different bit of a sub-vector of the binary vector. The masking technique is applied such that (i) the sub-vector index values that correspond to bits having a value of 0 are zeroed out and (ii) the sub-vector index values that correspond to the bits having a value of 1 are left unchanged. The masked sub-vector index values are sorted, and index values are calculated based on the masked sub-vector index values. The index values generated are then distributed uniformly to a number M of index memories such that the M index memories store substantially the same number of index values.
摘要翻译：在一个实施例中，本发明确定对应于值为1的二进制向量的比特的索引值。在每个时钟周期期间，将掩蔽技术应用于M个子向量索引值，其中每个子向量索引值对应于到二进制向量的子向量的不同位。应用掩蔽技术，使得（i）对应于具有值0的位的子向量索引值被清零，并且（ii）与具有值1的位相对应的子向量索引值被保留不变对掩蔽的子向量索引值进行排序，并且基于掩蔽的子向量索引值计算索引值。所生成的索引值然后均匀地分布到M个索引存储器，使得M个索引存储器存储大致相同数目的索引值。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式