𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Extending the Complex FastICA Algorithm to Noncircular Sources

✍ Scribed by Novey, M.; Adali, T.


Book ID
119822883
Publisher
IEEE
Year
2008
Tongue
English
Weight
672 KB
Volume
56
Category
Article
ISSN
1053-587X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


On the complexity of the extended euclid
✍ George Havas πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 92 KB

Euclid's algorithm for computing the greatest common divisor of 2 numbers is considered to be the oldest proper algorithm known ([10]). This algorithm can be amplified naturally in various ways. The GCD problem for more than two numbers is interesting in its own right. Thus, we can use Euclid's algo