| 序号 | 专利名 | 申请号 | 申请日 | 公开（公告）号 | 公开（公告）日 | 发明人 |
|---|---|---|---|---|---|---|
| 181 | Methods and systems for bandwidth amplification using replicated fragments | US12580058 | 2009-10-15 | US20100095015A1 | 2010-04-15 | Gal Zuckerman; Gil Thieberger |
| Bandwidth amplification using replicated fragments, including fractional-storage CDN servers storing erasure-coded fragments associated with content; and bandwidth amplification devices storing copies of sub-sets of the fragments stored on the servers in order to increase the system's total fragment delivery bandwidth. Wherein the average bandwidth amplification device comprises much less storage space and bandwidth than the average server, and the content can be reconstructed from any combination of enough unique fragments regardless of whether these fragments were obtained from the servers or from the bandwidth amplification devices. | ||||||
| 182 | Methods and systems for distributing pull protocol requests via a relay server | US12579954 | 2009-10-15 | US20100095014A1 | 2010-04-15 | Gal Zuckerman; Gil Thieberger |
| Distributing pull protocol requests via a relay server and thereby reducing the number of outgoing packets used by a fragment pull protocol, including the steps of aggregating, by an assembling device, a plurality of fragment pull protocol requests into an aggregated message; transmitting the aggregated message to a relay server, whereby the relay server distributes the requests to at least two fractional-storage servers; and receiving, by the assembling device from the at least two fractional-storage servers, a plurality of fragments in response to the aggregated message. | ||||||
| 183 | Fault Tolerance in a Distributed Streaming System | US12579662 | 2009-10-15 | US20100095013A1 | 2010-04-15 | Gal Zuckerman; Gil Thieberger |
| Fault tolerance in a distributed streaming system including fractional-storage CDN servers storing erasure-coded fragments encoded with a redundancy factor greater than one from segments of streaming contents. Each server delivers fragments, at a certain fragment delivery throughput, to multiple assembling devices using a fragment pull protocol, wherein a reduction in the fragment delivery throughput of one of the servers triggers a process in which at least some of the other servers approximately immediately increase their fragment delivery throughput as a reaction to the fragment pull protocol, to compensate for the reduced throughput. | ||||||
| 184 | Source-selection based Internet backbone traffic shaping | US12580129 | 2009-10-15 | US20100094986A1 | 2010-04-15 | Gal Zuckerman; Gil Thieberger |
| Source-selection based Internet backbone traffic shaping, including the steps of assessing a large number of network paths through which erasure-coded fragments usually flow when transmitted from a large number of relevant fractional-storage CDN servers to an assembling device; accessing preferences for fragment delivery via many of the paths; and selecting the servers whose assessed paths fit well the preferences for fragment delivery to the assembling device. Wherein the servers are accessed via the Internet, not all servers are connected to the Internet via the same networks, and the erasure-coded fragments are encoded with a redundancy factor greater than one from contents. | ||||||
| 185 | Adaptation of data centers' bandwidth contribution to distributed streaming operations | US12580205 | 2009-10-15 | US20100094975A1 | 2010-04-15 | Gal Zuckerman; Gil Thieberger |
| Adaptation of data centers' bandwidth contribution to distributed streaming operations, including data centers comprising fractional-storage CDN servers storing erasure-coded fragments encoded with a redundancy factor R greater than one, assembling devices obtaining the fragments from subsets of the servers, and measuring fragment delivery parameters, and at least one decision component that occasionally changes at least some of the servers of the subsets to generally improve the measured parameters. Wherein the smaller the number of subsets in which the servers of a data center participate, the lower the center's fragment delivery throughput, the higher the center's cost of delivering a fragment, and the higher the likelihood of reducing the amount of bandwidth acquired from that data center by the operator of the system. | ||||||
| 186 | Load-balancing an asymmetrical distributed erasure-coded system | US12580200 | 2009-10-15 | US20100094974A1 | 2010-04-15 | Gal Zuckerman; Gil Thieberger |
| Load-balancing an asymmetrical distributed erasure-coded system including fractional-storage CDN servers, storing, at a high storage gain, erasure-coded fragments encoded with a redundancy factor greater than one from segments, and a plurality of assembling devices, each obtaining fragments from a subgroup of the servers. The subgroups are selected from the servers still capable of increasing their fragment delivery throughput. Wherein not all of the servers have the same fragment delivery bandwidth capability, and the storage gain of each segment on each server is usually not strictly proportional to the bandwidth capability of the server, and the aggregated throughput used by the servers to deliver fragments may approach the aggregated bandwidth capabilities of the servers. | ||||||
| 187 | Latency based selection of fractional-storage servers | US12579858 | 2009-10-15 | US20100094970A1 | 2010-04-15 | Gal Zuckerman; Gil Thieberger |
| Latency based selection of fractional-storage servers, including the steps of identifying a first group of fractional-storage servers estimated to have low response latencies in relation to an assembling device. Retrieving, by the assembling device from a second group of fractional-storage servers, enough erasure-coded fragments for reconstructing approximately sequential segments of streaming content. While retrieving the fragments, identifying at least one server from the second group having latency higher than a certain threshold in response to a fragment pull protocol request. And using the fragment pull protocol to replace the identified server with at least one server selected from the first group. | ||||||
| 188 | EXPLOITING KNOWN PADDING DATA TO IMPROVE BLOCK DECODE SUCCESS RATE | US12537562 | 2009-08-07 | US20100020904A1 | 2010-01-28 | Phat TRAN |
| A method and system of decoding a convolutionally encoded data block having known padding bits. A Viterbi decoder is constrained to a state corresponding to k−1 padding bits immediately adjacent to data bits of the data block, where k is a constraint length of a convolution encoder used to encode the data block. Symbols of the encoded data block that have influence only from the padding bits are discarded. | ||||||
| 189 | Method for detecting and correcting data errors in an RF data link | US11584244 | 2006-10-20 | US20090217137A1 | 2009-08-27 | Ivan Reid; Peter Mackel; David Caskey |
| Methods for detecting and correcting data errors in an RF data link include identifying valid data frames and corrupted data frames by measuring a data corruption level for each transmitted data frame, comparing the measured data corruption level for each corrupted data frame to a data corruption threshold, reconstructing the corrupted data frames having a data corruption level below the data corruption threshold, reconstructing the data block using data from valid and reconstructed data frames, and/or verifying the data in the reconstructed data block. | ||||||
| 190 | Method to adaptively scale the input to a channel decoder | US10879491 | 2004-06-29 | US07515658B2 | 2009-04-07 | Karthik Muralidhar; Christopher Anthony Aldridge; Ser Wah Oh |
| The range R of effective bits (those containing information) within the N bit output(s) from an inner modem is determined and employed to select the M soft bits passed to a channel decoder, thereby avoiding underflow or overflow degrading the channel decoder performance. The average and standard deviation of 1P values for a base-two logarithm of the N bit output are used to determine the range R of effective bits, with the N bits shifted and clipped based on the computed value of R so that the M most significant bits from that range R are passed to the channel decoder. | ||||||
| 191 | Method of detecting and correcting errors for a memory and corresponding integrated circuit | US11220515 | 2005-09-07 | US07502985B2 | 2009-03-10 | Philippe Gendrier; Philippe Candelier; Richard Fournel |
| A method is for detecting and correcting errors for a memory storing at least one code block including information data and control data. The method includes reading and decoding each element of the at least one code block to deliver an information item representative of a number of errors in the at least one code block. The method further includes, when the number of errors exceeds one, modifying a parameter of the read by a chosen value, and performing a reading and decoding of the at least one code block again to obtain a new error information item. | ||||||
| 192 | Simple decoding method and apparatus | US10497337 | 2002-11-26 | US07487429B2 | 2009-02-03 | Constant Paul Marie Jozef Baggen |
| A method of decoding possibly mutilated codewords (r) of a code (C) into information words (m′) including information symbols (m′1, m′2, . . . , m′k), the information words (m) being encoded into codewords (c) of the code (C). In order not to considerably deviate from the standard method and apparatus for decoding a standard Reed-Solomon code, a method of decoding is proposed including decoding the possibly mutilated codewords (r) into codewords (r′), reconstructing information symbols (m′1, m′2, . . . , m′k) from the codewords (r′), comparing the reconstruct information symbols (m′1, m′2, . . . , m′k) with information symbols (m1) known a priori before decoding, and verifying decoding errors based on the result of the comparison. | ||||||
| 193 | Method of processing data for a decoding operation using windows of data | US10499943 | 2002-12-20 | US07333581B2 | 2008-02-19 | Sebastien Charpentier |
| The present invention relates to a method using windows of data, a window (w) comprising data to be written and to be read and having a size. It is characterized in that it comprises:* A step of writing a current window of data into a unique buffer (BUF) in a first address direction, said first address direction being at an opposite direction from an address direction of the writing of a preceding window of data, said writing of said current window beginning at an address where no data of the preceding window of data have been written, said buffer (BUF) having a length greater than the maximum size of the windows of data, and* A step of reading the data of said preceding window of data from said unique buffer (BUF), from a reading address equal to a last written address of the same preceding window of data, said reading being made simultaneously to said writing of the current window of data and in the same first address direction. | ||||||
| 194 | ANALOG CONTINUOUS TIME STATISTICAL PROCESSING | US11738696 | 2007-04-23 | US20070188354A1 | 2007-08-16 | Benjamin VIGODA; Neil GERSHENFELD |
| Methods for applications such as signal processing, analysis, and coding/decoding replace digital signal processing elements with analog components are implemented by combining soft logic gates and filters, permitting the functionality of complex finite state machines to be implemented. | ||||||
| 195 | Method and apparatus to perform customized error handling | US09815441 | 2001-03-22 | US07165202B2 | 2007-01-16 | David Arthur Eatough; James Sferas |
| A method and apparatus to perform customized error handling is described. For example, this method makes it possible to intercept and replace an error code generated by an application. Error messages, such as third party error messages, can be replaced. The application which generates the error message may or may not be updated. The files used by that application may or may not be updated. | ||||||
| 196 | IN-PLACE TRANSFORMATIONS WITH APPLICATIONS TO ENCODING AND DECODING VARIOUS CLASSES OF CODES | US11423376 | 2006-06-09 | US20060280254A1 | 2006-12-14 | Michael Luby; M. Shokrollahi |
| In an encoder for encoding symbols of data using a computing device having memory constraints, a method of performing a transformation comprising loading a source block into memory of the computing device, performing an intermediate transformation of less than all of the source block, then replacing a part of the source block with intermediate results in the memory and then completing the transformation such that output symbols stored in the memory form a set of encoded symbols. A decoder can perform decoding steps in an order that allows for use of substantially the same memory for storing the received data and the decoded source block, performing as in-place transformations. Using an in-place transformation, a large portion of memory set aside for received data can be overwritten as that received data is transformed into decoded source data without requiring a similar sized large portion of memory for the decoded source data. | ||||||
| 197 | Method of joint decoding of possibly multilated code words | US10506375 | 2003-02-14 | US20050108616A1 | 2005-05-19 | Andries Hekstra; Constant Baggen; Ludovicus Marinus Tolhuizen |
| The invention relates to a method of decoding possibly multilated code words (r) of a code (C), wherein an information word (m) and an address word (a) are encoded into a code word (c) of said code (C) using a generator matrix (G) and wherein said address words (a) are selected such that address words (a) having a known relationship are assigned to consecutive code words (c). To provide a reliable way of decoding making use of the known relationship, a method comprising the following steps is proposed: decoding the differences (D) of a number (L−1) of pairs of possibly mutilated code words (rib, ri+1) to obtain estimates (u, v) for the differences of the corresponding pairs of code words (ci, ci+1), combining said estimates (u, v) to obtain a number (L) of at least two corrupted versions (wj) of a particular code word (c), forming a code vector (z) from said number (L) of corrupted versions (wj) of said particular code word (c) in each coordinate, decoding said code vector (z) to a decoded code word (c′) in said code (C), and—using said generator matrix (G) to obtain the information word (m) and the address word (a) embedded in said decoded code word (c′). | ||||||
| 198 | Method for the optimization, under resource constraint, of the size of blocks of coded data | US10093495 | 2002-03-11 | US06892335B2 | 2005-05-10 | Arnaud Gueguen |
| A method of optimizing the size of blocks of coded data, intended to be subjected to iterative decoding, the method comprising a first step of evaluating a resource (T) available for the decoding of a block of normal size (N) and a second step of seeking, amongst a plurality of block sizes (N/k) which are submultiples of the normal size by an integer factor (k) greater than or equal to 1 and requiring on average a number of iterations ({overscore (n)}iterations(k)) compatible with the said available resource, the one which makes it possible to obtain the lowest error rate at the output of the iterative decoding. | ||||||
| 199 | Frame matching method | US09686786 | 2000-10-11 | US06888851B1 | 2005-05-03 | Feng Qian |
| The present invention pertains to a frame matching method for digital systems. Excess bits are deleted from a frame of data in a single iteration through the data, thereby creating a reduced length frame, wherein the deleting step is performed such that the distance between any two consecutive deleted bits within any group within first subset of the frame is A bits, and the distance between any two consecutive deleted bits within any group within a second subset of the frame is B bits, where A is an integer greater than 0 and B is an integer greater than A, and where the first subset and the second subset together form a plurality of consecutive bits. | ||||||
| 200 | Simple decoding method and apparatus | US10497337 | 2002-11-26 | US20050015701A1 | 2005-01-20 | Constant Paul Baggen |
| The invention relates to a method of decoding possibly mutilated codewords (r) of a code (C) into information words (m′) comprising information symbols (m′1, m′2, . . . ,m′k), said information words (m) being encoded into codewords (c) of said code (C). In order to provide a method and apparatus for decoding such a code without the need to considerably deviate from the standard method and apparatus for decoding a standard Reed-Solomon code, a method of decoding is proposed according to the present invention, comprising the steps of: decoding said possibly mutilated codewords (r) into codewords (r′)′, reconstructing information symbols (m′1, m′2, . . . ,m′k) from said codewords (r′), comparing said reconstruct information symbols (m′1, m′2, . . . ,m′k) with information symbols (m1) known a priori before decoding, and verifying decoding errors based on the result of said comparison. | ||||||
QQ群二维码
意见反馈
意见反馈