-
公开(公告)号：US11463113B2
公开(公告)日：2022-10-04
申请号：US16066866
申请日：2017-01-27
Applicant: Massachusetts Institute of Technology , Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V.
Inventor： Muriel Medard , Cornelius Hans Ulrich Hellge
Abstract: Systems and techniques described herein include jointly decoding coded data of different codes, including different coding algorithms, finite fields, and/or source blocks sizes. The techniques described herein can be used to improve existing distributed storage systems by allowing gradual data migration. The techniques can further be used within existing storage clients to allow application data to be stored within diverse different distributed storage systems.
-
公开(公告)号：US11451247B2
公开(公告)日：2022-09-20
申请号：US17371925
申请日：2021-07-09
Inventor： Muriel Medard , Kenneth R. Duffy
Abstract: Devices and methods described herein decode a sequence of coded symbols by guessing noise. In various embodiments, noise sequences are ordered, either during system initialization or on a periodic basis. Then, determining a codeword includes iteratively guessing a new noise sequence, removing its effect from received data symbols (e.g. by subtracting or using some other method of operational inversion), and checking whether the resulting data are a codeword using a codebook membership function. This process is deterministic, has bounded complexity, asymptotically achieves channel capacity as in convolutional codes, but has the decoding speed of a block code. In some embodiments, the decoder tests a bounded number of noise sequences, abandoning the search and declaring an erasure after these sequences are exhausted. Abandonment decoding nevertheless approximates maximum likelihood decoding within a tolerable bound and achieves channel capacity when the abandonment threshold is chosen appropriately.
-
公开(公告)号：US11424861B2
公开(公告)日：2022-08-23
申请号：US16497555
申请日：2018-03-29
Applicant: Massachusetts Institute of Technology , Code On Network Coding, LLC , Technische Universität Dresden
Inventor： Kerim Fouli , Frank Gabriel , Muriel Medard , Sreekrishna Pandi , Simon Wunderlich
IPC: H04L1/00 , H04L1/18 , H04L49/9057
Abstract: A method and apparatus decode packetized data in the presence of packet erasures using a finite sliding window technique. A decoder receives packets containing uncoded and coded symbols. When a packet with a coded symbol is received, the decoder determines whether a packet sequence number is within a sliding window of w consecutive sequence numbers that are no greater than a decoder sequence number, where the number w is fixed prior to encoding. When this is the case, the decoder decodes the coded symbol into one or more of the w input symbols using the coefficient vector. Decoding may use a forward error correcting (FEC) window within the finite sliding window. Decoding also may use a technique of Gaussian elimination to produce a “shifted” row echelon coefficient matrix.
-
公开(公告)号：US10735515B2
公开(公告)日：2020-08-04
申请号：US15986202
申请日：2018-05-22
Applicant: Massachusetts Institute of Technology
Inventor： Kishori Mohan Konwar , Prakash Narayana Moorthy , Muriel Medard , Nancy Ann Lynch
Abstract: A two-layer erasure-coded fault-tolerant distributed storage system offering atomic access for read and write operations is described. In some embodiments, a class of erasure codes known as regenerating codes (e.g. minimum bandwidth regenerating codes) for storage of data in a backend layer is used to reduce a cost of backend bulk storage and helps in reducing communication cost of read operations, when a value needs to be recreated from persistent storage in the backend layer. By separating the functionality of edge layer servers and backend servers, a modular implementation for atomicity using storage-efficient erasure-codes is provided. Such a two-layer modular architecture permits protocols needed for consistency implementation to be substantially limited to the interaction between clients and an edge layer, while protocols needed to implement erasure code are substantially limited to interaction between edge and backend layers.
-
公开(公告)号：US09537759B2
公开(公告)日：2017-01-03
申请号：US13754398
申请日：2013-01-30
Applicant: Massachusetts Institute of Technology
Inventor： Flavio du Pin Calmon , Jason M. Cloud , Muriel Medard , Weifei Zeng
IPC: H04L12/707 , H04B7/155 , H04L29/06 , H04L1/00
CPC classification number: H04L45/24 , H04B7/15521 , H04L1/0041 , H04L1/0076 , H04L69/14 , H04L2001/0096
Abstract: Techniques, devices, systems, and protocols are disclosed herein that relate to data transfer between communication nodes via multiple heterogeneous paths. In various embodiments, network coding may be used to improve data flow and reliability in a multiple path scenario. Transmission control protocol (TCP) may also be used within different paths to further enhance data transfer reliability. In some embodiments, multiple levels of network coding may be provided within a transmitter in a multiple path scenario, with one level being applied across ail paths and another being applied within individual paths.
Abstract translation: 本文公开了涉及通过多个异构路径的通信节点之间的数据传输的技术，设备，系统和协议。 在各种实施例中，可以使用网络编码来改善多路径场景中的数据流和可靠性。 传输控制协议（TCP）也可以在不同的路径内使用，以进一步增强数据传输的可靠性。 在一些实施例中，可以在多路径场景中的发射机内提供多级网络编码，其中一级被跨越一条路径应用，另一级被应用在各个路径内。
-
Patent Agency Ranking
6.发明申请公开(公告)号：US20160239606A1
公开(公告)日：2016-08-18
申请号：US15027868
申请日：2014-10-07
Applicant: RUTGERS, THE STATE UNIVERSITY OF NEW JERSEY , TRUSTEES OF BOSTON UNIVERSITY , MASSACHUSETTS INSTITUTE OF TECHNOLOGY
Inventor： Catherine M. Grgicak , Desmond S. Lun , Muriel Medard , Harish Swaminathan
CPC classification number: G16B40/00 , C12Q1/6851 , C12Q1/686 , C12Q2545/113
Abstract: Computerized analysis methods and systems to implement the computerized analysis methods are disclosed herein. Specifically, the present disclosure relates to systems and methods for determining an unknown characteristic of a sample.
Abstract translation: 本文公开了实现计算机化分析方法的计算机化分析方法和系统。 具体地，本公开涉及用于确定样品的未知特性的系统和方法。
-
7.发明申请Method And Apparatus For Performing Finite Memory Network Coding In An Arbitrary Network 有权用于在任意网络中执行有限存储器网络编码的方法和装置公开(公告)号：US20160006676A1
公开(公告)日：2016-01-07
申请号：US14843358
申请日：2015-09-02
Applicant: Massachusetts Institute of Technology
Inventor： Bernhard Haeupler , Muriel Medard
IPC: H04L12/879 , H04L12/861
CPC classification number: H04L49/901 , H04L1/0057 , H04L1/0077 , H04L47/50 , H04L49/90 , H04L49/9057 , H04L49/9094 , H04L2001/0097
Abstract: Techniques for performing finite memory network coding in an arbitrary network limit an amount of memory that is provided within a node of the network for the performance of network coding operations during data relay operations. When a new data packet is received by a node, the data stored within the limited amount of memory may be updated by linearly combining the new packet with the stored data. In some implementations, different storage buffers may be provided within a node for the performance of network coding operations and decoding operations.
Abstract translation: 用于在任意网络中执行有限存储器网络编码的技术限制了在数据中继操作期间执行网络编码操作的网络节点内提供的存储器量。 当节点接收到新的数据分组时，存储在有限量的存储器内的数据可以通过将新的分组与存储的数据线性组合来更新。 在一些实现中，可以在节点内提供不同的存储缓冲器，以执行网络编码操作和解码操作。
-
公开(公告)号：US20150348584A1
公开(公告)日：2015-12-03
申请号：US14668185
申请日：2015-03-25
Applicant: Massachusetts Institute of Technology
Inventor： Muriel Medard , Ulric J. Ferner
CPC classification number: G11B20/10481 , G11B20/10 , G11B20/1217 , G11B27/105 , G11B2020/10916
Abstract: Data blocks to be stored on a disk-based data storage device (e.g., a hard disk drive, etc.) are coded together to form a plurality of linearly independent network coded blocks. The network coded blocks are then stored on the data storage device. Coded seeking may then be used to retrieve the original data blocks from the data storage device in a time-efficient manner. A read request may be sent to the data storage device requesting an innovative coded packet associated with the original data blocks. In response to the read request, the data storage device may read an innovative coded packet from the disk that is closest to current position of a read element of the device.
Abstract translation: 要存储在基于磁盘的数据存储设备（例如，硬盘驱动器等）上的数据块被一起编码以形成多个线性独立的网络编码块。 网络编码块然后存储在数据存储设备上。 然后，编码寻找可以用于以时间有效的方式从数据存储设备中检索原始数据块。 读请求可以被发送到数据存储设备，请求与原始数据块相关联的创新编码分组。 响应于读取请求，数据存储设备可以从最接近设备的读取元件的当前位置的盘读取创新的编码包。
-
9.发明授权Method and apparatus for performing finite memory network coding in an arbitrary network 有权用于在任意网络中执行有限存储器网络编码的方法和装置公开(公告)号：US09160687B2
公开(公告)日：2015-10-13
申请号：US13761799
申请日：2013-02-07
Applicant: Massachusetts Institute of Technology
Inventor： Bernhard Haeupler , Muriel Medard
IPC: H04L12/861 , H04L1/00 , H04L12/54 , H04L12/879
CPC classification number: H04L49/901 , H04L1/0057 , H04L1/0077 , H04L47/50 , H04L49/90 , H04L49/9057 , H04L49/9094 , H04L2001/0097
Abstract: Techniques for performing finite memory network coding in an arbitrary network limit an amount of memory that is provided within a node of the network for the performance of network coding operations during data relay operations. When a new data packet is received by a node, the data stored within the limited amount of memory may be updated by linearly combining the new packet with the stored data. In some implementations, different storage buffers may be provided within a node for the performance of network coding operations and decoding operations.
Abstract translation: 用于在任意网络中执行有限存储器网络编码的技术限制了在数据中继操作期间执行网络编码操作的网络节点内提供的存储器量。 当节点接收到新的数据分组时，存储在有限量的存储器内的数据可以通过将新的分组与存储的数据线性组合来更新。 在一些实现中，可以在节点内提供不同的存储缓冲器，以执行网络编码操作和解码操作。
-
公开(公告)号：US20220358672A1
公开(公告)日：2022-11-10
申请号：US17730377
申请日：2022-04-27
Inventor： Mehrtash Babadi , Luca D'Alessio , Muriel Medard , Ken Duffy , Yonina Eldar
Abstract: A way to design a codebook for estimating the type of a molecule at a particular location in a fluorescence microscopy image makes use of one or both of (1) knowledge of the non-uniform prior distribution of molecule types (i.e., some types are known a priori to occur more frequently than others) and/or knowledge of co-occurrence of molecule types at close locations (e.g., in a same cell); and (2) knowledge of a model of the (e.g., random) process that yields the intensities that are expected at a location when a molecule with a particular subset of markers (i.e., a molecule of a type that has been assigned a codeword that defines that subset) is present at that location. The codebook design may provide experimental efficiency by reducing the number of images that need to be acquired and/or improve classification or detection accuracy by making the codewords for different molecule types more distinctive.
-
-
-
-
-
-
-
-
-
Search Results
65
records
(took 0.04 seconds)
