System and method for Huffman shaping in a data...

Pulse or digital communications – Bandwidth reduction or expansion

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C375S261000, C375S285000, C375S296000, C341S065000, C348S384100

Reexamination Certificate

active

08000387

ABSTRACT:
In a communication system, Huffman coding techniques are used to obtain shaping gains for an improvement in data transmission rates. More particularly, a novel method of Huffman shaping is described that achieves a shaping gain of greater than 1 dB. The shaping gain results in a higher data rate transmission in a communication system where transmitted power is constrained.

REFERENCES:
patent: 4586182 (1986-04-01), Gallager
patent: 5057917 (1991-10-01), Shalkauser et al.
patent: 5115453 (1992-05-01), Calderbank et al.
patent: 5140417 (1992-08-01), Tanaka et al.
patent: 5253078 (1993-10-01), Balkanski et al.
patent: 5268961 (1993-12-01), Ng
patent: 5297170 (1994-03-01), Eyuboglu et al.
patent: 5388124 (1995-02-01), Laroia et al.
patent: 5528628 (1996-06-01), Park et al.
patent: 5559561 (1996-09-01), Wei
patent: 5675332 (1997-10-01), Limberg
patent: 5714950 (1998-02-01), Jeong et al.
patent: 5850260 (1998-12-01), Rosenberg
patent: 5914840 (1999-06-01), Kawakami et al.
patent: 6064954 (2000-05-01), Cohen et al.
patent: 6208274 (2001-03-01), Taori et al.
patent: 6643402 (2003-11-01), Okada
patent: 6678334 (2004-01-01), Lee
patent: 6912070 (2005-06-01), Govindaswamy et al.
patent: 7043088 (2006-05-01), Chiu et al.
patent: 7308099 (2007-12-01), Allamanche et al.
patent: 197 48 880 C 1 (1999-05-01), None
B. Vasic et al., “Scrambling for Nonequiprobable Signalling,” Electronics Letters, IEE Stevenage, GB, vol. 32, No. 17, Aug. 15, 1996, pp. 1551-1552.
G. Ungerboeck, “Chapter 11: Huffman Shaping,”Codes, Graphs, and Systems, Mar. 2002, pp. 295-310.
G. Ungerboeck, “Information—Theoretic Reflections on PCM Voiceband Modems,” inCodes, Curves, and Signals—Common Threads in Communications, edited by A. Vardy, Kluwer Academic Publishers, 1998, pp. 193-200.
G. Ungerboeck, “Trellis-Coded Modulation with Redundant Signal Sets Part II: State of the Art,” IEEE Communications Magazine, vol. 25, No. 2, Feb. 1987, pp. 12-21.
F.R. Kschischang, “Optimal Nonuniform Signaling for Gaussian Channels,” 39 IEEE Transactions on Information Theory, No. 3, May 1993, pp. 913-929.
S. McLaughlin et al., “Shaping Codes Constructed from Cost-Constrained Graphs,” 43 IEEE Transactions on Information Theory, No. 2, Mar. 1997, pp. 692-699.
J. Abrahams, “Variable-Length Unequal Cost Parsing and Coding for Shaping,” 44 IEEE Transactions on Information Theory, No. 3, No. 4, Jul. 1998, pp. 1648-1650.
R. Blahut, “Computation of Channel Capacity and Rate-Distortion Functions,” IEEE Transactions on Information Theory, vol. IT-18, No. 4, Jul. 1972, pp. 460-473.
D.A. Huffman, “A Method for the construction of minimum-redundancy codes,” Proc. IRE, vol. 40, 1952, pp. 1098-1101.
M. Tomlinson, “New automatic equalizer employing modulo arithmetic,” Electron. Lett., vol. 7, Mar. 1971, pp. 138-139.
G. D. Forney, Jr., “Trellis shaping,” IEEE Trans. Inform. Theory, vol. 38, Mar. 1992, pp. 281-300.
P. Fortier, et al., “Multidimensional signal sets through the shell construction for parallel channels,” IEEE Trans. Commun., vol. 40, Mar. 1992, pp. 500-512.
A. K. Khandani et al., “Shaping multidimensional signal spaces—Part I: Optimum shaping, shell mapping,” IEEE Trans. Inform. Theory, vol. 39, Nov. 1993, pp. 1799-1808.
G. R. Lang et al., “A Leech lattice modem,” IEEE J. Select. Areas Commun., vol. 7, Aug. 1989, pp. 968-973.
G. Ungerboeck et al., Broadcom Corporation, “Coding for V.90 Issue 2,” TR-30.1/99-11-064R1, Telecommunications Industry Association, Clearwater Beach, FL, Nov. 29, 1999.
G. Ungerboeck, “Channel Coding with Multilevel/Phase Signals,” IEEE Transactions on Information Theory, vol. IT-28, No. 1, Jan. 1982, pp. 55-67.
G. Ungerboeck, “Trellis-coded Modulation with Redundant Signal Sets, Part 1: Introduction,” IEEE Communications Magazine, vol. 25, No. 2, Feb. 1987, pp. 5-11.
“Series V: Data Communication over the Telephone Network,” ITU-T Recommendation V.90 (Sep. 1998).
H. Harashima et al., “Marched-transmission technique for channels with intersymbol interference,” IEEE Trans. Commun., vol. COM-20, Aug. 1972, pp. 774-780.
R. Laroia, N. Farvardin and S. Tretter, “On optimal shaping of multi-dimensional constellations,” IEEE Trans. Inform. Theory, vol. 40, Jul. 1994, pp. 1044-1056.
G.D. Forney et al., “Modulation and coding for linear Gaussian channels,” IEEE Trans. Inform. Theory. vol. 44, No. 6, Oct. 1998, pp. 2384-2415.
G.D. Forney et al., “Multidimensional constellations—Part I: Introduction, figures of merit, and generalized cross constellations,” IEEE J. Select. Areas Commun., vol. 7, No. 6, Aug. 1989, pp. 877-892.
T.M. Cover, et al.,Elements of Information Theory, Wiley Series in Telecommunications, A Wiley-Interscience Publication, 1991, pp. 1-542.
J.M. Wozencraft et al.,Principles of Communication Engineering, Chapter 6—“Implementation of Coded Systems,” John Wiley & Sons, Inc., 1965, pp. 363-484.
ITU-T Recommendation V.90 (Sep. 1998).
ITU-T Recommendation V.34 (Feb. 1998).

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

System and method for Huffman shaping in a data... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with System and method for Huffman shaping in a data..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for Huffman shaping in a data... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2782810

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.