Decoding of Walsh codes

Details Decoding of Walsh codes Decoding of Walsh codes

2006-10-05

2009-08-25

Tse, Young T. (Department: 2611)

Pulse or digital communications

Spread spectrum

Direct sequence

C375S142000, C375S147000, C370S209000

Reexamination Certificate

active

07580451

ABSTRACT:
Methods, systems, devices, and computer program products for decoding of Walsh codewords are disclosed.

REFERENCES:
patent: 5465269 (1995-11-01), Schaffner et al.
patent: 5805633 (1998-09-01), Uddenfeldt
patent: 5901182 (1999-05-01), Kot
patent: 5931964 (1999-08-01), Beming et al.
patent: 5973643 (1999-10-01), Hawkes et al.
patent: 6016322 (2000-01-01), Goldman
patent: 6035207 (2000-03-01), Wang et al.
patent: 6154507 (2000-11-01), Bottomley
patent: 6208615 (2001-03-01), Faruque et al.
patent: 6285876 (2001-09-01), Zhong
patent: 6356911 (2002-03-01), Shibuya
patent: 6381726 (2002-04-01), Weng
patent: 6442392 (2002-08-01), Ruutu et al.
patent: 6490327 (2002-12-01), Shah
patent: 6546256 (2003-04-01), Maloney et al.
patent: 6560462 (2003-05-01), Ravi et al.
patent: 6621807 (2003-09-01), Jung et al.
patent: 6631142 (2003-10-01), Miyamoto et al.
patent: 6731674 (2004-05-01), Yang et al.
patent: 6757544 (2004-06-01), Rangarajan et al.
patent: 6788750 (2004-09-01), Reuven et al.
patent: 6915123 (2005-07-01), Daudelin et al.
patent: 6920125 (2005-07-01), Wu
patent: 6978124 (2005-12-01), Benes et al.
patent: 6987798 (2006-01-01), Ahn et al.
patent: 7013150 (2006-03-01), Okanoue et al.
patent: 7068638 (2006-06-01), Choi et al.
patent: 2003/0012265 (2003-01-01), Lin
patent: 2003/0063595 (2003-04-01), You et al.
patent: 2003/0235240 (2003-12-01), Kawamoto et al.
patent: 2004/0062214 (2004-04-01), Schnack et al.
patent: 2004/0114623 (2004-06-01), Smith
patent: 2004/0209580 (2004-10-01), Steinheider et al.
patent: 2004/0252665 (2004-12-01), Clark et al.
patent: 2004/0259571 (2004-12-01), Joshi
patent: 2004/0264553 (2004-12-01), McDonough et al.
patent: 2005/0163075 (2005-07-01), Malladi et al.
patent: 2005/0195732 (2005-09-01), Huh et al.
patent: 2005/0228854 (2005-10-01), Steinheider et al.
patent: 2005/0286536 (2005-12-01), Steinheider et al.
patent: 2006/0007919 (2006-01-01), Steinheider et al.
International Search Report, PCT/US03/36709, mailed on May 25, 2004, 4 pgs.
Cormen et al., 2001, Introduction to Algorithms Second Edition, McGraw-Hill, Boston.
Ekroot, L. and Dolinar, S., “A* Decoding of Block Codes”,IEEE Transactions on Communications, vol. 44 (9):1052-1056 (1996).
Fano, “A Heuristic Discussion of Probabilistic Decoding”,IEEE Transactions on Information Theory, vol. IT9(1):64-74 (1963).
Forney, Jr., “Convolutional Codes II. Maximum-Likelihood Decoding”,Information and Control, vol. 25:222-266 (1974).
Forney, Jr., “The Viterbi Algorithm”,Proceedings of the IEEE, vol. 61(3):268-278 (1973).
Han et al., “Efficient Priority-First Search Maximum-Likelihood Soft-Decision Decoding of Linear Block Codes”,IEEE Transactions on Information Theory, vol. 39(5):1514-1523 (1993).
Han et al., “A Maximum-Likelihood Soft-Decision Sequential Decoding Algorithm for Binary Convolutional Codes”,IEEE Transactions on Communications, vol. 50(2):173-178 (2002).
Heller, J. and Jacobs, I. M., “Viterbi Decoding for Satellite and Space Communication”,IEEE Transactions on Communication Technology, vol. Com-19(5):835-848 (1971).
Kang, G. and Zhang, P., “The Implementation of Viterbi Decoder on TMS320C6201 DSP in WCDMA System”,Beijing University of Posts and Telecommunications.
Rajagopal, S., “A Real-Time Baseband Communications Processor for High Data Rate Wireless Systems”, Dept. of Electrical and Computer Engineering, Rice University (2002).
Sereni et al., “A Software Re-Configurable Architecture for 3G and Wireless Systems”, University of Perugia, Italy (2000).
Varga, R. and Harrison, M. (eds), The Art of Computer Programming-Second Edition, Addison-Wesley, Massachusetts (1973).
Viterbi, “Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm”,IEEE Transactions on Information Theory, vol. IT-13(2):260-269 (1967).
Wicker, S. B., Error Control Systems for Digital Communication and Storage, Prentice Hall, Englewood Cliffs, NJ (1995).
International Search Report—PCT/US03/25218.
M. Abramowitz, et al,Handbook of Mathematical Functions with Formulas, Graphs and Mathematical Tables, Dover Publications, New York, 1965.
J.L. Massey,Threshold Decoding, Technical Report 410, MIT Press, Cambridge, MA, 1963.
K. Paterson, et al.,Efficient Decoding Algorithms for Generalised Reed-Muller Codes, Technical Report, Hewlett-Packard Labs, Nov. 1998.
Bob Pearson,Complementary Code Keying Made Simple, Application Note 9850, http://www/intersil.com/data/an/an9/an9850/an9850.pdf, May 2000.
I. Reed,A Class of Multiple-Error-Correcting Codes and the Decoding Scheme, IRETransactions on Information Theory, PGIT-4:38-49, Sep. 1954.
R. van Nee,OFDM Codes for Peak-to-Average Power Reduction and Error Correction, In Proc. IEEE Globecom '96, London, England, pp. 740-744, Nov. 1996.
G.N. Watson,A Treatise on the Theory of Bessel Functions, Second Edition, Cambridge University Press, 1952.
International Search Report PCT/US03/25219 mailed Dec. 16, 2003.
http://www.fcc.gov/911/enhanced/.
http://www.arraycomm.com/.
International Search Report, PCT/US05/07136, mailed on Dec. 26, 2006, 6 pgs.
EIA/TIA/IS-95 Mobile Station-Base Station Compatibility Standard for Dual-Mode Wideband Spread Spectrum Cellular System, Telecommunications Industry Association, Jul. 1993, pp. 6-1 to 6-8.
L. Trevisan, “Some Applications of Coding Theory in Computational Complexity,” Quaderni di Matematica, vol. 13, pp. 347-424, 2004.
J.S. Lee and L.E. Miller, CDMA Systems Engineering Handbook, Artech House, Boston, 1998.
A.J. Viterbi, CDMA: Principles of Spread Spectrum Communication, Addison-Wesley, Reading, MA, 1995.
R.K. Yarlagadda and J.E. Hershey, Hadamard Matrix Analysis and Synthesis, with Applications to Communications and Signal/Image Processing, Kluwer Academic, Boston, 1997.
A.V. Oppenheim and R.W. Shafer, with J.R. Buck, Discrete-Time Signal Processing, 2nd ed., Prentice Hall, Upper Saddle River, NJ, 1999.
V.S. Pless and W.C. Huffman, Eds., Handbook of Coding Theory, vol. 1, Elsevier Science, Amsterdam, 1998.
S.J. MacMullan and O.M. Collins, “A Comparison of Known Codes, Random Codes, and the Best Codes,” IEEE Transactions on Information Theory, vol. 44, No. 7, pp. 3009-3022, Nov. 1998.
M. Luby, “LT-codes,” in Proceedings of the 43rd Annual IEEE Symposium on the Foundations of Computer Science (FOCS), pp. 271-280, 2002.
A. Shokrollahi, “Raptor codes,” in Proceedings of the IEEE International Symposium on Information Theory, p. 36, 2004.

Affiliated with

Also associated with

Rating

Decoding of Walsh codes does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Decoding of Walsh codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decoding of Walsh codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4133398