IP Library Granted Patent US 7,027,532
Granted Patent B2
US 7,027,532 · App. 10/027,824 · Granted Apr 11, 2006

Viterbi decoding with channel and location information

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 7,027,532
App. No.
10/027,824
Granted
Apr 11, 2006
Kind
B2
Abstract

A method for exploiting location information inherent in the location of points within a transmitted signal constellation. A common method for assigning weights to branch metrics in a Viterbi decoder is to assign Hamming weights which are summations of the number of places in which a received bit pattern differs from the bit pattern assigned to a branch metric. Signal strength information may be incorporated into the weight assigned to a branch metric in the Viterbi decoder. Additionally information-inherent in the location of the points within a constellation may be taken into account. Bit errors which require a larger deviation to occur are given higher weights, and bit errors which require less deviation to occur are given lower weights. By taking into account signal strength and location information up to 2 dB of coding gain can be realized.

Claims (79)

1. A method for Viterbi decoding comprising:

receiving a sampled signal;

making a hard decision on which constellation point the sampled signal represents thereby creating a hard decision point;

determining a scaling factor (k) corresponding to the hard decision point; and

providing the scaling factor (k) and the hard decision to a Viterbi decoder,

wherein determining a scaling factor (k) corresponding to the hard decision point comprises:

selecting a first constellation point corresponding to the hard decision point;

determining a second constellation point corresponding to a nearest constellation point having a designated received bit; and

assigning a scaling factor value dependent on the number of constellation points between the first constellation point and the second constellation point.

2. The method as in claim 1 wherein making a hard decision on which constellation point the sampled signal represents comprises choosing a constellation point which is the closest Euclidean distance to the received sample signal.

3. The method as in claim 1 wherein comparing the designated received bit to the hard decision to compute the scaling factor comprises reading the scaling factor from a look up table.

4. The method of claim 3 wherein reading the scaling factor from a look up table further comprises:

using the designated received bit and the hard decision to index into a look up table; and

reading the scaling factor from the look up table.

5. The method as in claim 1 wherein comparing the designated received bit to the hard decision to compute the scaling factor comprises:

selecting a transition for which the scaling factor will be determined, thereby determining a selected transition;

determining the designated received bit that will result in the selected transition; and

comparing the designated received bit to the hard decision to compute the scaling factor.

6. The method of claim 5 wherein assigning a scaling factor dependent on the number of constellation points between the first constellation point and the second constellation point comprises:

assigning a value of zero to the scaling factor if the first constellation point is equal to the second constellation point;

assigning a value of 1 if the first constellation point is adjacent to the second constellation point; and

assigning a value of 2N+1 if the first constellation point is separated from the second constellation point by N constellation points.

7. The method as in claim 1 wherein determining a scaling factor (k) corresponding to the hard decision point further comprises:

determining a first scaling factor dependent on a location information of the hard decision;

determining a second scaling factor dependent on a signal to noise ratio of the channel; and

combining the first scaling factor with the second scaling factor to produce the scaling factor k.

8. The method of claim 7 wherein the means for determining the scaling factor (k) corresponding to the hard decision point further comprises:

means for determining a first scaling factor dependent on a location information of the hard decision;

means for determining a second scaling factor dependent on a signal to noise ratio of the channel; and

means for multiplying the first scaling factor to the second scaling factor to produce the sealing factor (k).

9. An apparatus for decoding a signal, the apparatus comprising:

means for receiving a sampled signal;

means for making a hard decision on which constellation point the sampled signal represents;

means for determining a scaling factor (k) corresponding to the hard decision points; and

means for providing the scaling factor (k) and the hard decision to a Viterbi decoder,

wherein determining a scaling factor (k) corresponding to the hard decision point comprises:

selecting a first constellation point corresponding to the hard decision point;

determining a second constellation point corresponding to a nearest constellation point having a designated received bit; and

assigning a scaling factor value dependent on the number of constellation points between the first constellation point and the second constellation point.

10. A method of signal decoding comprising:

accepting a received signal;

quantizing the received signal to a point in a signal constellation plane, to provide a quantized point;

making a hard decision as to which constellation point the quantized point represents;

determining scaling factors (k's) associated with each constellation point;

using the scaling factors and hard decision point to determine decoder metrics; and

providing a decoder metrics and quantized point to a Viterbi decoder.

11. The method of claim 10 wherein making a hard decision as to which constellation point the quantized point represents comprises:

determining which constellation point is closest to the quantized point; and

assigning a value of nearest constellation point to the quantized point.

12. The method of claim 11 wherein determining which constellation point is closest to the quantized point comprises:

computing a Euclidean distance squared between the quantized point and a candidate constellation point; and

selecting the constellation point with a smallest Euclidean distance squared as the closest constellation point.

13. The method as in claim 12 wherein selecting the constellation point with a smallest Euclidean distance squared comprises:

(a) squaring an X direction distance between the quantized point and the candidate constellation point to provide a squared X direction distance;

(b) squaring a Y direction distance between the quantized point and the candidate constellation point to provide a squared Y direction distance;

(c) adding the squared X direction distance to the squared Y direction distance to find a Euclidean distance squared;

(d) repeating steps a, b and c for all candidate points;

(e) selecting the candidate point with a smallest Euclidean distance squared.

14. The method as in claim 10 wherein determining the scaling factors associated with each quantized point comprises:

determining an amount of noise necessary to create an error in a candidate bit; and

assigning the scaling factor in proportion to the amount of noise necessary to create an error in a candidate bit.

15. The method of claim 10 further comprising:

multiplying the scaling factors times a signal to noise ratio (SNR) scaling factor to provide a scaled SNR result; and

using the scaled SNR result to determine the decoder metrics.

16. The method of claim 15 wherein using the scaled SNR result to determine the decoder metrics comprises:

using the results as an index into a branch metric table; and

reading the metric associated with the index.

17. An apparatus comprising:

an input for accepting a received signal;

a quantizer that accepts the received signal from the input and quantizes the input to a point in a signal constellation plane, to provide a quantized point;

a hard decision unit that accepts the quantized point and determines a constellation point that the quantized point represents;

a scaling factor unit that determines scaling factors associated with the constellation point; and

a metric calculator that accepts the scaling factors and the constellation point and determines branch metrics for the constellation point.

18. An apparatus of claim 17 further comprising:

a Viterbi decoder that accepts the constellation points and the branch metrics and produces decoded bits.

19. The apparatus of claim 17 wherein the metric calculator comprises:

an input that accepts a signal to noise ratio (SNR);

an input that accepts scaling factors; and

a combination circuit that combines the scaling factors and SNR to create a branch metric.

Assignments (7)
CORRECTIVE ASSIGNMENT TO CORRECT THE EXECUTION DATE OF THE MERGER PREVIOUSLY RECORDED ON REEL 047642 FRAME 0417. ASSIGNOR(S) HEREBY CONFIRMS THE ASSIGNMENT, Recorded Mar 6, 2019
From: AVAGO TECHNOLOGIES GENERAL IP (SINGAPORE) PTE. LTD.
To: AVAGO TECHNOLOGIES INTERNATIONAL SALES PTE. LIMITED
Reel/Frame 048521/0395 →
MERGER Recorded Oct 5, 2018
From: AVAGO TECHNOLOGIES GENERAL IP (SINGAPORE) PTE. LTD.
To: AVAGO TECHNOLOGIES INTERNATIONAL SALES PTE. LIMITED
Reel/Frame 047642/0417 →
TERMINATION AND RELEASE OF SECURITY INTEREST IN PATENTS Recorded Feb 3, 2017
From: BANK OF AMERICA, N.A., AS COLLATERAL AGENT
To: BROADCOM CORPORATION
Reel/Frame 041712/0001 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 1, 2017
From: BROADCOM CORPORATION
To: AVAGO TECHNOLOGIES GENERAL IP (SINGAPORE) PTE. LTD.
Reel/Frame 041706/0001 →
PATENT SECURITY AGREEMENT Recorded Feb 11, 2016
From: BROADCOM CORPORATION
To: BANK OF AMERICA, N.A., AS COLLATERAL AGENT
Reel/Frame 037806/0001 →
MERGER Recorded Aug 6, 2003
From: BROADCOM HOMENETWORKING, INC.
To: BROADCOM CORPORATION
Reel/Frame 014363/0596 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 20, 2001
From: LAUER, JOSEPH PAUL
To: BROADCOM HOMENETWORKING, INC.
Reel/Frame 012413/0601 →