Talk:Gold code

Balanced codes

This page was revised 10 November 2006 by 59.182.20.199.

The revision includes the new statement:

All 2^m+1 sequences are balanced and contain 2^m-1 ones and 2^m-1 zeros.

This is not true. Look at Table 3-I and Figure 3-10 in IS-GPS-200D, a 974 kB file available at:

http://www.navcen.uscg.gov/gps/geninfo/default.htm

http://www.navcen.uscg.gov/gps/geninfo/IS-GPS-200D.pdf

This shows a way to form the C/A codes (Gold codes) by tapping 2 bit locations in the G2 register and modulo 2 summing the result. There are "10 choose 2", or 45, ways to do this. However, Table 3-I shows only 36 codes. The reason is that the other 9 are unbalanced (typically 480 bits of one value and 543 of the other). This is why the pseudorandom noise (PRN) codes 34 and 37 are identical.

Recommend removing the last sentence from this Wikipedia entry.

[ Being new to Wikipedia participation, I take to heart the admonition to avoid arbitrarily making a change, and the recommendation to first discuss it with the previous editor. ]

Banchang (talk) 22:37, 18 November 2007 (UTC)[reply]

Xilinx app note

The link to the Xilinx app note XAPP217 is dead and I am unable to find the note anywhere on xilinx.com.

MJ (talk) 17:49, 23 August 2010 (UTC)[reply]

A simplified example would be nice

I don't think i understand this enough to do it myself; but IMO it would be good if the article had an example of how to construct Gold codes and how they are used, using short enough lengths that people can easily keep up with.