Pulse or digital communications – Systems using alternating or pulsating current – Plural channels for transmission of a single pulse train
Reexamination Certificate
2008-04-01
2008-04-01
Phu, Phuong (Department: 2611)
Pulse or digital communications
Systems using alternating or pulsating current
Plural channels for transmission of a single pulse train
C375S265000, C375S341000, C714S792000, C714S794000, C714S795000
Reexamination Certificate
active
10748998
ABSTRACT:
Method for computing distances to received data points. A preferred embodiment comprises determining a first point on a grid nearest to the received point, computing a second point closest to the received point inside a specified area, wherein the second point is a point in a first coset, computing a third, fourth, and fifth point, wherein each point is a member of a different coset and each point is the closest point in its coset to the received point, and computing a distance from the received point to each of the second, third, fourth, and fifth points.
REFERENCES:
patent: 6594319 (2003-07-01), Shaikh
patent: 7224743 (2007-05-01), Holmes et al.
“International Telecommunication Union—ITU-T G.992.1—Series G: Transmission Systems and Media, Digital Systems and Networks, Digital Transmission Systems—Digital Sections and Digital Line System—Access Networks—Asymmetric Digital Subscriber Line (ADSL) Transceivers,” International Telecommunication Union, Jun. 1999, Geneva, Switzerland.
Ali Murtaza
Dasgupta Udayan
Mujica Fernando A.
Brady W. James
Phu Phuong
Shaw Steven A.
LandOfFree
Algorithm for computing distances to a received point in an... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Algorithm for computing distances to a received point in an..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithm for computing distances to a received point in an... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3926921