IP Library Granted Patent US 6,891,853
Granted Patent B1
US 6,891,853 · App. 09/687,700 · Granted May 10, 2005

Frame matching method

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 6,891,853
App. No.
09/687,700
Granted
May 10, 2005
Kind
B1
Abstract

A frame of digital data with L symbols is matched to a frame with N symbols by making that number of copies of the original L symbols that results in N symbols. In particular, M=floor(N/L) is computed. L2=N−ML is computed. (L1=L−L2 where L1 and L2 solve the simultaneous equations L1+L2=L and L1*M+L2*(M+1)=N). The frame is effectively divided into two mutually exclusive groups of symbols; one group (consisting of L1 symbols) is copied M times and the other group (consisting of L2 symbols) is copied M+1 times.

Claims (11)

1. A method for increasing a size of a frame of digital data from a first number of original symbols (L) to a second number of symbols (N), where the digital data comprising the frame is ordered from a first bit to an Lth symbol, the method comprising the steps of:

(a) Receiving the frame;

(b) Storing in a digital memory a first integer number (M) of copies of each of a first group of the original symbols, where M is greater than 1;

(c) Storing in the digital memory at least one copy of each of a second group of the original symbols;

(d) Further processing the symbols stored in the digital memory according to steps (b) and (c) in a digital communications system;

wherein the frame consists of the first group and the second group and the first group and the second group are mutually exclusive; and wherein steps (b) and (c) are performed such that the total number of symbols copied to the digital memory in steps (b) and (c) is equal to N.

2. The method according to claim 1 wherein step (b) is performed such that each of the second group of symbols is multiplied by the same number X.

3. The method according to claim 2 wherein X=M+1.

4. The method according to claim 3 wherein the first group and the second group are selected by serially processing the symbols.

5. The method according to claim 4 wherein symbols are selected to be in the first group or the second group such that, where A is a total number of symbols that have previously been selected for the first group and B is a total number of symbols that have previously been selected for the second group, the ratio between A/B is as close to 1 as possible.

6. The method according to claim 1 where M=floor(N/L).

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 20, 2020
From: INTEL CORPORATION
To: APPLE INC.
Reel/Frame 052916/0308 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 11, 2015
From: VIA TELECOM CO., LTD.
To: INTEL CORPORATION
Reel/Frame 037096/0075 →