• Non ci sono risultati.

[1] R. L. Peterson, R. E. Ziemer, D. E. Borth, Introduction to Spread-Spectrum Communications, Englewood Cliffs, NJ: Prentice-Hall, 1995.

N/A
N/A
Protected

Academic year: 2021

Condividi "[1] R. L. Peterson, R. E. Ziemer, D. E. Borth, Introduction to Spread-Spectrum Communications, Englewood Cliffs, NJ: Prentice-Hall, 1995. "

Copied!
3
0
0

Testo completo

(1)

Bibliografia

[1] R. L. Peterson, R. E. Ziemer, D. E. Borth, Introduction to Spread-Spectrum Communications, Englewood Cliffs, NJ: Prentice-Hall, 1995.

[2] S. Lin, D. J. Costello, Error Control Coding: Fundamentals and Applications, Englewood Cliffs, NJ: Prentice-Hall, 1983.

[3] W. W. Peterson, E. J. Weldon, Error Correcting Codes, Cambridge, Mass.:

MIT Press, 1972

[4] NAVSTAR GPS Joint Program Office (J

PO

), “GPS NAVSTAR User’s Overview”, YEE-82-009D, GPS JPO, 1991

[5] R. Gold, “Optimal Binary Sequences for Spread Spectrum Multiplexing”, IEEE Transactions on Information Theory, Vol. 13, pp. 619-621, 1967.

[6] A. Polydoros, C. L. Weber, “A Unified Approach to Serial Search Spread -

Spectrum Code Acquisition”, IEEE Transaction on Communications, Vol. 32,

No. 5, pp. 542-560, 1984.

(2)

Bibliografia

[7] M. K. Simon, J. K. Omura, R. A. Scholtz, B. K. Levitt, Spread Spectrum Communications Handbook, New York: McGraw Hill, 1994.

[8] K. M. Chugg, M. Zhu, “A New Approach to Rapid PN Code Acquisition Using Iterative Message Passing Techniques”, IEEE Journal on Selected Areas in Communications, Vol. 23, No. 5, pp. 884-897, 2005.

[9] R. G. Gallager, “Low Density Parity Check Codes”, IRE Transaction on Information Theory, pp. 21-28, 1962.

[10] M. Luise, L. Giugno, “Introduzione ai Low-Density Parity-Check codes”, Dispensa del corso di Comunicazioni a larga banda, 2003.

http://www2.ing.unipi.it/~d7384/HTML/SdT/Codici_LDPC.zip

[11] R. M. Tanner, “A recursive approach to low complexity codes”, IEEE Transaction on Information Theory, pp.533-547, 1981.

[12] D. J. C. MacKay, “Good Error Correcting Codes Based on Very Sparse Matrices”, IEEE Transaction on Information Theory, Vol. 45, No. 2, pp. 399- 431, 1999.

[13] F. R. Kschischang, B. J. Frey, H. A. Loeliger, “Factor Graphs and the Sum- Product Algorithm”, IEEE Transaction on Information Theory, Vol. 47, No. 2, pp. 498-519, 2001.

86

(3)

Bibliografia

[14] O. W. Yeung, K. M. Chugg, “An Iterative Algorithm and Low Complexity Hardware Architecture for Fast Acquisition of Long PN Codes in UWB Systems”, Journal in VLSI and Signal Processing Special Issue on UWB, Springer, vol. 43, April 2006.

87

Riferimenti

Documenti correlati

When, as in the above example, one of the columns contains text strings, the column is by default stored as a factor with as many different levels as there are unique text strings

Here you can open files, view plots (also previous plots), install and load packages or use the help function.. You can change the size of the windows by drag- ging the grey

save the sheet in CSV (comma delimited) format *.csv – in Notepad (or another text editor):. open the file *.csv and check the used characters for the variable separator and the

À mesure que la guerre avance et que la renommée respectable des Allemands n’est plus qu’un lointain souvenir, une véritable dichotomie entre civilisation et barbarie

the power method and Arnoldi process are proposed for computing the dominant.. eigenvector which defines the structure of the

Spatial objects like the lnd object are made up of a number of different slots, the key slots being @data (non geographic attribute data) and @polygons (or @lines for line data)..

It may not be surprising that the generic print function does not do the actual printing, but rather looks at the class of an object and then calls the specific print method of

(In practice, the pseudo-random sequence is mixed or multiplied with the information signal, giving an impression that the original data flow was "hashed" by the PRN.) If