Patent US5737337A successfully refreshed from Google Patents.
← Back to Patent Explorer
US5737337A Expired / Lapsed US ⏱️ 0.0 years remaining

Method and apparatus for interleaving data in an asymmetric digital subscriber line (ADSL) transmitter

Assignee: Apple Inc
•
Filing: 1996-09-30
•
Granted: 1998-04-07
•
Expires: 2016-09-30
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract In an ADSL transmitter (62), data is flamed and split between a fast path and an interleave path by multiplexer (66). Data is forward error correction encoded in FEC encoder (70). Data on the interleave path is interleaved by interleaver (72) if an interleave depth (D) is >2. During interleaving, at least one additional read operation is performed, after a series of consecutive write and read operations. The additional read operation permits interleaving to continue without waiting for a next frame of data to arrive at the interleaver. An equal number of additional write operations compensates for the additional reads at a later point. Use of an interleaving memory can also be avoided by turning off or disabling the interleaver, while still permitting data to be sent along the interleave path. Transmit path controller (74) senses if D=1, and if so disables the interleaver and avoids the need for interleaver memory (64).

Inventors

  • 👤 Raymond P. Voith
  • 👤 Sujit Sudhaman

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-27 21:25
CPC Classifications
H; H04; H04L; H04L1/00; H04L1/004; H04L1/0056; H04L1/0071; H04L1/0041

Claims Analysis

Total Claims: 29
Claim 1
Independent Claim 139 words
A transmitter for interleaving data comprising: means for receiving digital information, and for selectively dividing the digital information between a fast path and an interleave path to produce a plurality of frames of data; a forward error correction encoder, coupled to the fast path and to the interleave path, for providing error correction to the plurality of frames to produce codewords in both the fast path and the interleave path, wherein each codeword is comprised of a plurality of bytes of data; and an interleaver, coupled to the forward error correction encoder, for interleaving the plurality of bytes of data in a codeword allocated to the interleave path by changing an order of write-read operations by inserting at least one additional read operation in at least one of the plurality of frames to produce an interleaved plurality of frames.
Claim 2
Dependent Claim 139 words
A transmitter for interleaving data comprising: means for receiving digital information, and for selectively dividing the digital information between a fast path and an interleave path to produce a plurality of frames of data; a forward error correction encoder, coupled to the fast path and to the interleave path, for providing error correction to the plurality of frames to produce codewords in both the fast path and the interleave path, wherein each codeword is comprised of a plurality of bytes of data; and an interleaver, coupled to the forward error correction encoder, for interleaving the plurality of bytes of data in a codeword allocated to the interleave path by changing an order of write-read operations by inserting at least one additional read operation in at least one of the plurality of frames to produce an interleaved plurality of frames.
Claim 3
Dependent Claim 31 words
The transmitter of claim 1, further comprising a storage element, coupled between the forward error correction encoder and the interleaver for buffering the plurality of bytes of data in the codeword.
Claim 4
Dependent Claim 33 words
The transmitter of claim 1, further comprising a storage element coupled to the interleaver, for temporarily storing at least some of the plurality of bytes of data of the codeword for subsequent transmission.
Claim 5
Dependent Claim 26 words
The transmitter of claim 3, further comprising a transmit path controller for selectively disabling at least a portion of the interleaver and bypassing the storage element.
Claim 6
Dependent Claim 32 words
The transmitter of claim 4 wherein an amount of interleaving is determined by an interleave depth, and when the interleave depth is equal to one, the transmit path controller disables the interleaver.
Claim 7
Dependent Claim 27 words
The transmitter of claim 5 wherein the interleave path is reconfigured to bypass the storage element in a case when the interleave depth is equal to one.
Claim 8
Dependent Claim 27 words
The transmitter of claim 6 wherein the transmitter is implemented as a single integrated circuit and the storage element is characterized as being external to the transmitter.
Claim 9
Dependent Claim 20 words
The transmitter of claim 4 wherein the interleaver transfers a frame without interleaving the frame and bypasses the storage element.
Claim 10
Dependent Claim 38 words
The transmitter of claim 1 wherein the interleaver adds a number of write operations at an end of the codeword, wherein the number of write operations is equal in number to the at least one additional read operation.
Claim 11
Dependent Claim 16 words
The transmitter of claim 1 wherein the transmitter is an asymmetric digital subscriber line (ADSL) transmitter.
Claim 12
Dependent Claim 15 words
The transmitter of claim 10 wherein the means for receiving digital information comprises a multiplexer.
Claim 13
Dependent Claim 27 words
The transmitter of claim 10 further comprising a constellation encoder, coupled to the interleave path and to the fast path, the constellation encoder for producing encoded symbols.
Claim 14
Dependent Claim 158 words
An asymmetric digital subscriber line (ADSL) transmitter, comprising: a multiplexer for receiving digital information, and for selectively dividing the digital information between a fast path and an interleave path to produce a plurality of flames of data; a forward error correction encoder, coupled to the fast path and to the interleave path, for providing error correction to the plurality of frames to produce codewords in both the fast path and the interleave path, wherein each codeword is comprised of a plurality of bytes of data; an interleaver, coupled to the forward error correction encoder, for interleaving the plurality of bytes of data in a codeword allocated to the interleave path; a transmit path controller coupled to the interleaver for selectively disabling at least a portion of the interleaver and for permitting bypass of an interleaver storage element; and a constellation encoder, coupled to the interleave path and to the fast path, the constellation encoder for producing encoded symbols.
Claim 15
Dependent Claim 158 words
An asymmetric digital subscriber line (ADSL) transmitter, comprising: a multiplexer for receiving digital information, and for selectively dividing the digital information between a fast path and an interleave path to produce a plurality of flames of data; a forward error correction encoder, coupled to the fast path and to the interleave path, for providing error correction to the plurality of frames to produce codewords in both the fast path and the interleave path, wherein each codeword is comprised of a plurality of bytes of data; an interleaver, coupled to the forward error correction encoder, for interleaving the plurality of bytes of data in a codeword allocated to the interleave path; a transmit path controller coupled to the interleaver for selectively disabling at least a portion of the interleaver and for permitting bypass of an interleaver storage element; and a constellation encoder, coupled to the interleave path and to the fast path, the constellation encoder for producing encoded symbols.
Claim 16
Dependent Claim 52 words
The ADSL transmitter of claim 13 wherein the ADSL transmitter is implemented as a single integrated circuit and the interleaver storage element is characterized as being external to the ADSL transmitter, and wherein when an interleave depth is equal to one, the interleave path is configured to bypass the interleaver storage element.
Claim 17
Independent Claim 185 words
A method for interleaving bytes of data in a plurality of codewords, the method comprising the steps of: serially receiving S frames of data having an aggregate of K bytes, where S is a total number of frames in one codeword of the plurality of codewords, and where K and S are integers; performing forward error correction encoding on the S frames to produce the one codeword wherein the one codeword comprises K+R bytes of data, where R is a total number of redundancy bytes in the one codeword and is an integer, and where R/S is an integer; performing a series of consecutive write and read operations on a first predetermined number of bytes in the plurality of codewords; performing consecutive read operations on a second predetermined number of bytes of the plurality of codewords; determining that a last frame of the S flames is received and performing at least one consecutive write and read operation on a third predetermined number of bytes of the plurality of codewords; and performing a write operation on a fourth predetermined number of bytes of the one codeword.
Claim 18
Independent Claim 185 words
A method for interleaving bytes of data in a plurality of codewords, the method comprising the steps of: serially receiving S frames of data having an aggregate of K bytes, where S is a total number of frames in one codeword of the plurality of codewords, and where K and S are integers; performing forward error correction encoding on the S frames to produce the one codeword wherein the one codeword comprises K+R bytes of data, where R is a total number of redundancy bytes in the one codeword and is an integer, and where R/S is an integer; performing a series of consecutive write and read operations on a first predetermined number of bytes in the plurality of codewords; performing consecutive read operations on a second predetermined number of bytes of the plurality of codewords; determining that a last frame of the S flames is received and performing at least one consecutive write and read operation on a third predetermined number of bytes of the plurality of codewords; and performing a write operation on a fourth predetermined number of bytes of the one codeword.
Claim 19
Dependent Claim 39 words
The method of claim 15 wherein the first predetermined number is equal to K/S, the second predetermined number is equal to R/S, the third predetermined number is equal to (K+R)/S, and the fourth predetermined number is equal to (S-1)R/S.
Claim 20
Independent Claim 128 words
A method for interleaving data arranged in flames, the method comprising the steps of: serially receiving S frames of data having an aggregate of K words, where S is a total number of flames in a codeword, and where K and S are integers and K/S is an integer; performing forward error correction encoding on the S flames to produce the codeword; providing a storage element; and interleaving a plurality of bytes of the codeword by accessing the storage element for a plurality of first operations and a plurality of second operations wherein the plurality of first operations is equal in number to the plurality of second operations, and wherein the storage element is accessed for at least one additional second operation for a frame of the codeword.
Claim 21
Independent Claim 128 words
A method for interleaving data arranged in flames, the method comprising the steps of: serially receiving S frames of data having an aggregate of K words, where S is a total number of flames in a codeword, and where K and S are integers and K/S is an integer; performing forward error correction encoding on the S flames to produce the codeword; providing a storage element; and interleaving a plurality of bytes of the codeword by accessing the storage element for a plurality of first operations and a plurality of second operations wherein the plurality of first operations is equal in number to the plurality of second operations, and wherein the storage element is accessed for at least one additional second operation for a frame of the codeword.
Claim 22
Dependent Claim 29 words
The method of claim 17 wherein the plurality of first operation is a plurality of write operations and the plurality of second operations is a plurality of read operations.
Claim 23
Dependent Claim 106 words
The method of claim 17 wherein the step of interleaving comprises the steps of: accessing the storage element for a series of consecutive first and second operations for a first predetermined number of times; accessing the storage element for a second predetermined number of consecutive second operations to the storage element; determining that a last frame of the S flames is received and performing at least one consecutive first operation and second operation on a third predetermined number of times; and accessing the storage element for a fourth predetermined number of first operations, wherein the fourth predetermined number is a function of the second predetermined number.
Claim 24
Dependent Claim 22 words
The method of claim 19 wherein the series of consecutive first and second operations comprises a series of write and read operations.
Claim 25
Dependent Claim 49 words
The method of claim 19 wherein as a result of performing forward error correction encoding, R bytes of redundancy data are included in the codeword, where R is an integer, and wherein the first predetermined number is equal to K/S and the second predetermined number is equal to R/S.
Claim 26
Dependent Claim 23 words
The method of claim 21 wherein the third predetermined number is equal to (K+R)/S and the fourth predetermined number is equal to (S-1)R/S.
Claim 27
Dependent Claim 107 words
The method of claim 17 wherein the step of interleaving comprises the steps of: accessing the storage element for a series of consecutive first and second operations to produce a first interleave frame; accessing the storage element for a first predetermined number of second operations and adding the first predetermined number of second operations to an end of the first interleave frame; and accessing the storage element for a second predetermined number of first operations which is a function of the first predetermined number of second operations, and adding the second predetermined number of first operations to a second interleave frame subsequent to the first interleave frame.
Claim 28
Dependent Claim 24 words
The method of claim 23 wherein the series of consecutive first and second operations comprises a series of consecutive write operation and read operations.
Claim 29
Dependent Claim 14 words
The method of claim 23 wherein the first predetermined number is equal to R/S.

References Cited (Backward Citations)

US5596604A Cited
US5495483A Cited
US5636224A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2001-04-06 2001-10-06 2002-04-07 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2005-04-06 2005-10-06 2006-04-07 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2009-04-06 2009-10-06 2010-04-07 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag