Pseudo noise sequence acquisition in spread spectrum systems

Details Pseudo noise sequence acquisition in spread spectrum systems Pseudo noise sequence acquisition in spread spectrum systems

2007-04-20

2011-11-29

Dunn, Drew A (Department: 2857)

Data processing: measuring, calibrating, or testing

Measurement system

Measured signal processing

C702S106000, C714S746000, C714S758000, C714S781000

Reexamination Certificate

active

08069015

ABSTRACT:
Systems and methods for signal analysis are described. The method can include digitizing a signal modulated by a pseudo noise (PN) sequence, dividing the digitized signal into a plurality of sample blocks, and estimating a PN phase embedded in a sample block of the plurality of sample blocks using an iterative message passing algorithm (iMPA) executed on a redundant graphical model.

REFERENCES:
patent: 2003/0237039 (2003-12-01), Qiu
patent: 2006/0085727 (2006-04-01), Azenkot et al.
Kschischang et al., Iterative Decoding of Compound Codes by Probability Propagation in Graphical Models, Jan. 1998, IEEE Journal on Selected Areas in Communications, vol. 16 No. 1, p. 1-11.
Shimizu et al., Partially-Parallel LDPC Decoder Based on High-Efficiency Message-Passing Algorithm, Proceedings of the 2005 International Conference on Computer Design (ICCD'05), IEEE, p. 1-8.
Richardson et al., The Capacity of Low-Density Parity-Check Codes Under Message-Passing Decoding, Feb. 2001, IEEE Transactions on Inforamtion Theory, vol. 47 No. 2, p. 599-618.
Ungerboeck, G., Trellis-Coded Modulation with Redundant Signal Sets, Feb. 1987, IEEE Communications Magazine, vol. 25, No. 2, pp. 5-21.
Park et al., CRC Codes Based on a Non-Primitive Generator Polynomial: A New Error Control Scheme Targeting a Prescribed Set of Error Patterns, May 8, 2006, IEEE, DOI: 10.1109/INTMAG.2006.375883, pp. 301.
Zhu et al., Iterative Message Passing Techniques for Rapid Code Acquisition, Military Communications Conference, 2003. MILCOM 2003. IEEE.
Abbasfar and Yao, “An efficient and practical architecture for high speed turbo decoders,”IEEE 58th Vehicular Technology Conference, Oct. 2003, 1:337-341.
Aji and McEliece, “The generalized distributive law,”IEEE Trans. Information Theory, 46(2):325-343 (Mar. 2000).
Aji, S.M., “Graphical models and iterative decoding,” Ph.D. dissertation, California Institute of Technology, 2000, 64 pages.
Bahl, L.R. et al., “Optimal decoding of linear codes for minimizing symbol error rate,”IEEE Transactions on Information Theory, 20: 284-287 (1974).
Benedetto and Montorsi, “Design of parallel concatenated convolutional codes,”IEEE Trans. Communication, 44:591-600 (May 1996).
Benedetto et al., “Serial concatenation of interleaved codes: performance analysis, design, and iterative decoding,”IEEE Trans. Information Theory, 44(3):909-926 (May 1998).
Benedetto et al., “Soft-input soft-output modules for the construction and distributed iterative decoding of code networks,”European Trans. Telecommun., 9(2):155-172 (Mar.-Apr. 1998).
Berrou and Glavieux, “Near optimum error correcting coding and decoding: turbo-codes,”IEEE Trans. Communication, 44(10):1261-1271 (Oct. 1996).
Berrou et al., “Near shannon limit error-correcting coding and decoding: turbo-codes,”Proc. International Conf. Communications, Geneva, Switzerland, May 1993, pp. 1064-1070.
Chugg and Zhu, “A new approach to rapid PN code acquisition using iterative message passing techniques,”IEEE J. Select. Areas Commun., 2005, 23(5):884-897 (May 2005).
Dielissen and Huisken, “State vector reduction for initialization of sliding windows MAP,”2nd International Symposium on Turbo Codes&Related Topics, Brest, France, 2000, pp. 387-390.
Gallager, “Low-Density Parity-Check codes,”IEEE Trans. Information Theory, 8(1) :21-28, (Jan. 1962).
Gallager, “Low-Density Parity-Check Codes,” Cambridge, MA: Monograph, MIT Press, 1963, 90 pages.
Hekstra, “An alternative to metric rescaling in Viterbi decoders,”IEEE Trans. Communication, 37(11):1220-1222 (1989).
Homier and Scholtz, “Rapid acquisition of ultra-wideband signals in the dense multipath channel,”IEEE Conference on Ultra Wideband Systems and Technologies, 2002, pp. 105-109.
Kschischang et al., “Factor graphs and sum-product algorithm,”IEEE Trans. Information Theory, 47:498-519 (Feb. 2001).
MacKay and Neal, “Near Shannon limit performance of low density parity check codes,”IEEE Electronics Letters, 1996, 32(18):1645-1646.
Masera et al., “VLSI architectures for turbo codes,”IEEE Trans. on Very Large Scale Integration(VLSI), 7(3):369-379 (1999).
McEliece et al., “Turbo decoding as an instance of Pearl's ‘belief propagation’ algorithm,”IEEE J. Select. Areas Commun., 16(2):140-152 (Feb. 1998).
O'Donnell et al., “An integrated, low power, ultra-wideband transceiver architecture for low-rate, indoor wireless systems,”IEEE CAS Workshop on Wireless Communications and Networking, Sep. 2002, 8 pages.
Polydoros and Weber, “A unified approach to serial search spread-spectrum code acquisition—Part I: General Theory,”IEEE Trans. Communication, 32:542-549 (May 1984).
Polydoros and Weber, “A unified approach to serial search spread-spectrum code acquisition—Part II: A Matched-Filter Receiver,”IEEE Trans. Communication, 32:550-560 (May 1984).
Santhi and Vardy, “On the effect of parity-check weights in iterative decoding,”Proc. IEEE Internat. Symp. Information Theory(ISIT), Chicago, IL, Jun. 27-Jul. 2, 2004, p. 100.
Schwartz and Vardy, “On the stopping distance and the stopping redundancy of codes,”IEEE Trans. Information Theory, 52(3):922-932 (Mar. 2006).
Tanner, “A recursive approach to low complexity codes,”IEEE Trans. Information Theory, vol. IT-27, No. 5, pp. 533-547 (1981).
Viterbi, A.J., “An Intuitive Justification and a Simplified Implementation of the MAP Decoder for Convolutional Codes,”IEEE J. Select. Areas Commun., vol. 16, No. 2, pp. 260-264 (Feb. 1998).
Wiberg, “Codes and decoding on general graphs,” Ph.D. dissertation, Linköping University (Sweden), Dissertation No. 440, 1996 , http://www.essrl.wustl.edu/˜jao/itrg/wiberg.pdf, 104 pages.
Yang and Hanzo, “Acquisition ofm-Sequences Using Recursive Soft Sequential Estimation,”IEEE Trans. Communication, 52(2):199-204 (Feb. 2004).
Yang and Hanzo, “Iterative soft sequential estimation assisted acquisition ofm-sequences,”IEEE Electronics Letters, 38(24):1550-1551 (2002).
Yedidia et al., “Generating code representations suitable for belief propagation decoding,”Proc. 40th Allerton Conference Commun., Control, and Computing, Monticello, IL, Oct. 2002, pp. 447-456.
Yeung, O.W. and K.M. Chugg, “An Iterative Algorithm and Low Complexity Hardware Architecture for Fast Acquisition of Long PN Codes in UWB Systems,” Journal of VLSI Signal Processing Sytems, vol. 43, No. 1, pp. 25-42 (Apr. 2006).
Yoon and Bar-Ness, “A parallel MAP algorithm for low latency turbo decoding,”IEEE Communications Letters, 6(7):288-290 (Jul. 2002).

Affiliated with

Also associated with

Rating

Pseudo noise sequence acquisition in spread spectrum systems does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Pseudo noise sequence acquisition in spread spectrum systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Pseudo noise sequence acquisition in spread spectrum systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4306848