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

Intersymbol interference channel coding scheme

Assignee: Nokia of America Corp
•
Filing: 1993-06-14
•
Granted: 1996-01-30
•
Expires: 2013-06-14
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Intersymbol interference and precoding loss are minimized by combining the precoding and coding operations. An intersymbol interference coder uses a feedback loop to apply a dither sequence to a sequence of input signal points. The dither signal applied to each input signal point is a function of the previous signal points in the sequence. The intersymbol interference coder implements, for example, a trellis coding operation by selecting one of several different modulo operations to determine the magnitude of the dither signal, the selection being made in response to the current trellis state. The sequence of signal points output from the intersymbol interference coder generates a valid sequence of the trellis code input to the Viterbi decoder.

Inventors

  • 👤 Rajiv Laroia

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-02 07:29
CPC Classifications
H; H04; H04L; H04L25/00; H04L25/38; H04L25/40; H04L25/49; H04L25/497; H04L25/4975; H03; H03M; H03M13/00; H03M13/25; H04L25/02; H04L25/03; H04L25/03006; H04L25/03343

Claims Analysis

Total Claims: 24
Claim 1
Independent Claim 86 words
A method for transmitting data over an intersymbol interference channel using a predetermined signal-space code, the method comprising the steps of: receiving a sequence of input signal points (408) selected from a predetermined constellation of signal points; and adding a dither signal to each of the input signal points, the dither signal (406) applied to a present signal point being selected as a function of previous signal points in the sequence and the current state of a finite-state machine (400) used to generate the signal-space code.
Claim 2
Independent Claim 86 words
A method for transmitting data over an intersymbol interference channel using a predetermined signal-space code, the method comprising the steps of: receiving a sequence of input signal points (408) selected from a predetermined constellation of signal points; and adding a dither signal to each of the input signal points, the dither signal (406) applied to a present signal point being selected as a function of previous signal points in the sequence and the current state of a finite-state machine (400) used to generate the signal-space code.
Claim 3
Dependent Claim 16 words
The invention of claim 1 wherein the predetermined constellation of signal points comprises a shaped constellation.
Claim 4
Dependent Claim 17 words
The invention of claim 1 wherein the predetermined constellation of signal points comprises a shaped, trellis-coded constellation.
Claim 5
Dependent Claim 13 words
The invention of claim 1 wherein the signal-space code comprises a trellis code.
Claim 6
Dependent Claim 43 words
The invention of claim 4 wherein the trellis code is based on partitioning of a lattice, and the dither signal is a point within a Voronoi region of a sub-lattice in the first level of lattice partitioning used to generate the trellis code.
Claim 7
Independent Claim 106 words
A method for transmitting data over an intersymbol interference channel, the method comprising the steps of: partitioning a constellation of signal points into a first group of subsets; partitioning each of the subsets in the first group of subsets into at least two subsets; generating a sequence of input signal points (102) selected from the constellation; and adding a dither signal (406) to each of the input signal points, the dither signal applied to a present signal point being a point within a Voronoi region of a subset in the first group of subsets and being a function of a previous signal point in the sequence.
Claim 8
Independent Claim 106 words
A method for transmitting data over an intersymbol interference channel, the method comprising the steps of: partitioning a constellation of signal points into a first group of subsets; partitioning each of the subsets in the first group of subsets into at least two subsets; generating a sequence of input signal points (102) selected from the constellation; and adding a dither signal (406) to each of the input signal points, the dither signal applied to a present signal point being a point within a Voronoi region of a subset in the first group of subsets and being a function of a previous signal point in the sequence.
Claim 9
Dependent Claim 83 words
Data transmission apparatus for transmitting data using a predetermined signal-space code, comprising: means for selecting a sequence of input signal points (102) from a predetermined constellation of signal points; and means for adding a dither signal (104) to each of the input signal points, including means for selecting the dither signal applied to a present signal point as a function of the previous signal points in the sequence and the current state of a finite-state machine (400) used to generate the signal-space code.
Claim 10
Dependent Claim 83 words
Data transmission apparatus for transmitting data using a predetermined signal-space code, comprising: means for selecting a sequence of input signal points (102) from a predetermined constellation of signal points; and means for adding a dither signal (104) to each of the input signal points, including means for selecting the dither signal applied to a present signal point as a function of the previous signal points in the sequence and the current state of a finite-state machine (400) used to generate the signal-space code.
Claim 11
Dependent Claim 16 words
The invention of claim 7 wherein the predetermined constellation of signal points comprises a shaped constellation.
Claim 12
Dependent Claim 17 words
The invention of claim 7 wherein the predetermined constellation of signal points comprises a shaped, trellis-coded constellation.
Claim 13
Dependent Claim 13 words
The invention of claim 7 wherein the signal-space code comprises a trellis code.
Claim 14
Dependent Claim 44 words
The invention of claim 10 wherein the trellis code is based on a lattice, and the means for selecting the dither signal selects a point within a Voronoi region of the lattice in the first level of partitioning used to generate the trellis code.
Claim 15
Independent Claim 90 words
A method for transmitting data over an intersymbol interference channel using a predetermined signal-space code, the method comprising the steps of: receiving a stream of input data (102); and generating a sequence of coded signal points (406, 410) of the signal-space code, the current point of the signal space code is a function of selected data from said stream of input data and the current output of a finite-state machine, wherein the current input to the finite-state machine is derived from a previously generated signal point of the signal-space code.
Claim 16
Independent Claim 90 words
A method for transmitting data over an intersymbol interference channel using a predetermined signal-space code, the method comprising the steps of: receiving a stream of input data (102); and generating a sequence of coded signal points (406, 410) of the signal-space code, the current point of the signal space code is a function of selected data from said stream of input data and the current output of a finite-state machine, wherein the current input to the finite-state machine is derived from a previously generated signal point of the signal-space code.
Claim 17
Dependent Claim 13 words
The invention of claim 12 wherein the signal-space code comprises a trellis code.
Claim 18
Dependent Claim 100 words
Apparatus for transmitting data over an intersymbol interference channel using a predetermined signal-space code, comprising: means for receiving a stream of input data (102); a finite-state machine (400) having a current input and generating a current output; and means for generating a sequence of coded signal points (406) of the signal-space code, the current point of the signal-space code is a function of selected data from said stream of input data and the current output of a finite-state machine (400), wherein the current input to the finite-state machine is derived from a previously generated signal point of the signal-space code.
Claim 19
Dependent Claim 100 words
Apparatus for transmitting data over an intersymbol interference channel using a predetermined signal-space code, comprising: means for receiving a stream of input data (102); a finite-state machine (400) having a current input and generating a current output; and means for generating a sequence of coded signal points (406) of the signal-space code, the current point of the signal-space code is a function of selected data from said stream of input data and the current output of a finite-state machine (400), wherein the current input to the finite-state machine is derived from a previously generated signal point of the signal-space code.
Claim 20
Dependent Claim 13 words
The invention of claim 14 wherein the signal-space code comprises a trellis code.
Claim 21
Independent Claim 96 words
A method for transmitting data over an intersymbol interference channel to a receiver using a predetermined signal-space code, the method comprising the steps of: receiving a stream of input signal points (102); and modifying a current input signal point value (104) to generate at an input to a Viterbi decoder in said receiver a current sample of a sequence of the signal-space code, said modifying being performed as a function of a current output of a finite-state machine, the finite-state machine receiving as a current input the previous sample of said sequence of the signal-space code.
Claim 22
Independent Claim 96 words
A method for transmitting data over an intersymbol interference channel to a receiver using a predetermined signal-space code, the method comprising the steps of: receiving a stream of input signal points (102); and modifying a current input signal point value (104) to generate at an input to a Viterbi decoder in said receiver a current sample of a sequence of the signal-space code, said modifying being performed as a function of a current output of a finite-state machine, the finite-state machine receiving as a current input the previous sample of said sequence of the signal-space code.
Claim 23
Independent Claim 100 words
A method for transmitting data over an intersymbol interference channel using a predetermined trellis code based on partitioning a lattice, the method comprising the steps of: receiving a sequence of input signal points (408) selected from a predetermined constellation of signal points; and adding a dither signal (408) to each of the input signal points, the dither signal applied to a present signal point being selected as a function of previous signal points in the sequence and being a point within a Voronoi region of a sublattice in a first level of lattice partitioning used to generate the trellis code.
Claim 24
Independent Claim 100 words
A method for transmitting data over an intersymbol interference channel using a predetermined trellis code based on partitioning a lattice, the method comprising the steps of: receiving a sequence of input signal points (408) selected from a predetermined constellation of signal points; and adding a dither signal (408) to each of the input signal points, the dither signal applied to a present signal point being selected as a function of previous signal points in the sequence and being a point within a Voronoi region of a sublattice in a first level of lattice partitioning used to generate the trellis code.

References Cited (Backward Citations)

US5040191A Cited
US5150381A Cited
US5159610A Cited
US5195107A Cited
US5388124A Cited
US5396519A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1999-01-29 1999-07-31 2000-01-30 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2003-01-29 2003-07-31 2004-01-30 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2007-01-29 2007-07-31 2008-01-30 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag