Fast algorithms for M-Sequence Type and E-sequence type hadamard matrices

Proceedings - ISSTA 1992: IEEE 2nd International Symposium on Spread Spectrum Techniques and Applications

Volumn , Issue , 1992, Pages 55-58

  Suehiro, N ^a  

^a Tokyo Engineering University   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 48049094741     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISSSTA.1992.665627     Document Type: Conference Paper

References (6)

1. M. Cohn and A. Lempel, "On Fast M-Sequence Transforms, " IEEE Trans, on Information Theory, IT-23 (1977) 135-137.
2. A. Lempel, "Hadamard and M-Sequence are Permu-tationally Similar, " Appl. Opt., vol. 18 (1979) 4064-4065.
3. T. Moriuchi, S. Uehara and K. Imamura, "Fast Construction of a Permutation Matrix between M-Sequence Matrix and Sylvester-Type Hadamard Matrix, " Proceedings of the 14th Symposium on Information Theory and its Applications (1991) 609-612 (in Japanese).
4. N. Suehiro, "Factorization of Hadamard Matrices, " Graduation Thesis of the University of Tokyo (in Japanese), (1972).
5. N. Suehiro and M. Hatori, "N-Shift Cross-Orthogonal Sequences, " IEEE Trans, on Information Theory, IT-34 (1988) 143-146.
6. Y. Taki, H. Miyakawa, M. Hatori and S. Namba, "Even-Shift Orthogonal Sequences, " IEEE Trans, on Information Theory, IT-15 (1969) 295-300.