Welch-Costas array: Difference between revisions
Content deleted Content added
No edit summary |
mNo edit summary |
||
| Line 1: | Line 1: | ||
A '''Welch-Costas array''' is a [[ |
A '''Welch-Costas array''' is a [[Costas array|Costas array]] generated using the following method. |
||
We take a primitive element, alpha, of a prime, p. We raise alpha to successive powers, modulo p. This creates a Costas permutation of length p-1. |
We take a primitive element, alpha, of a prime, p. We raise alpha to successive powers, modulo p. This creates a Costas permutation of length p-1. |
||
Revision as of 19:37, 25 May 2006
A Welch-Costas array is a Costas array generated using the following method.
We take a primitive element, alpha, of a prime, p. We raise alpha to successive powers, modulo p. This creates a Costas permutation of length p-1.
Example: 2 is a primitive element of 5. 3^1 = 3 3^2 = 9 = 4 (mod 5) 3^3 = 27 = 2 (mod 5) 3^4 = 81 = 1 (mod 5)
[3 4 2 1] is a Costas permutation.