Coded data generation or conversion – Digital code to digital code converters – Tree structure
Reexamination Certificate
2006-10-31
2006-10-31
Barnie, Rexford (Department: 2819)
Coded data generation or conversion
Digital code to digital code converters
Tree structure
C341S058000, C341S065000, C341S067000, C341S068000, C341S080000
Reexamination Certificate
active
07129863
ABSTRACT:
The design of communication and storage systems requires a choice of modulation and coding. In conventional storage and communication systems, the commonly used modulation scheme is called Non Return to Zero (NRZ) and the commonly used codes are called Run Length Limited (RLL) codes. The disclosure describes a new modulation scheme that can be used to increase the data transmission rate or storage density. The disclosure also describes codes that are referred to as Interval Modulation Codes, which can be used to transmit or store information efficiently using the new modulation scheme. Also described are procedures for determining if there exist suitable Interval Modulation Codes, given predetermined parameters that describe their desired performance. The disclosure also describes procedures or algorithms for constructing optimal Interval Modulation Codes given a set of parameters that describe their performance. The described techniques can be used in different communication (e.g. fiber optical, wireless, wireline, etc.) and storage (e.g. magnetic, optical, etc.) systems.
REFERENCES:
patent: 5151697 (1992-09-01), Bunton
patent: 5216423 (1993-06-01), Mukherjee
patent: 5534861 (1996-07-01), Chang et al.
patent: 5973626 (1999-10-01), Berger et al.
patent: 6188797 (2001-02-01), Moledina et al.
patent: 6563439 (2003-05-01), Acharya et al.
Complexity of the Variable Length Encoding Problem, Proc. 6th Southeast Conf. on Combinatorics, Graph Theory and Computing, Congressus Numerantium XIV, Utilitas Mathematica Publishing, Winnepeg, MB, Canada, at 211-244 (1975), unknown date.
Fourer, Robert and Gregory, John W., “Linear Programming FAQ” (1997). World Wide Web http://www.mcs.anl.gov/home/otc/faq/linear-programming-faq.html, Usenet sci.answers, anonymous FTP/pub/usenet/sci.answers/linear-programming-faw from rtfm.mit.edu, unknown date.
Golin et al., “Prefix Codes: Equiprobable Words, Unequal Letter Costs”, SIAM J. Computing, vol. 25, No. 6 at 1281-1292 (1996), unknown date.
Huffman, “A Method for the Construction of Minimum Redundancy Codes”, Proceedings of the IRE, vol. 40, No. 9 at 1098-1101 (1952), unknown date.
Kapoor et al., “Optimum Lopsided Binary Trees”, J. ACM, vol. 36, No. at 573-590 (1989), unknown date.
Perl et al., “Efficient Generation of Optimal Prefix Code: Equiprobable Words Using Unequal Cost Letters”, J. ACM, vol. 22, No. 2 at 202-214 (1975), unknown date.
“Tunstall in Synthesis of Noiseless Compression Codes”, thesis at Georgia Institute of Technology (1967), no month.
Varn, “Optimal Variable Length Codes”, Inf. Control, vol. 19, No. 4, at 289-301 (1971), unknown date.
Bruck Jehoshua
Mukhtar Saleem
Barnie Rexford
California Institute of Technology
Nguyen Khai M.
Townsend and Townsend and Crew
LandOfFree
Interval modulation coding does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Interval modulation coding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Interval modulation coding will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3719603