|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
An Efficient Algorithm for Determining Hadamard Sequency Vectors
March 1979 (vol. 28 no. 3)
pp. 243-244
| ASCII Text | x | ||
| S.N. Srihari, M.K. Ohanesian, "An Efficient Algorithm for Determining Hadamard Sequency Vectors," IEEE Transactions on Computers, vol. 28, no. 3, pp. 243-244, March, 1979. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.1979.1675325, author = {S.N. Srihari and M.K. Ohanesian}, title = {An Efficient Algorithm for Determining Hadamard Sequency Vectors}, journal ={IEEE Transactions on Computers}, volume = {28}, number = {3}, issn = {0018-9340}, year = {1979}, pages = {243-244}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1979.1675325}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - An Efficient Algorithm for Determining Hadamard Sequency Vectors IS - 3 SN - 0018-9340 SP243 EP244 EPD - 243-244 A1 - S.N. Srihari, A1 - M.K. Ohanesian, PY - 1979 KW - Walsh functions KW - Hadamard functions KW - image processing KW - orthogonal transforms KW - sequency (ordering) VL - 28 JA - IEEE Transactions on Computers ER - | |||
An efficient algorithm for determining the sequency vector S?n of a 2n? 2nHadamard matrix is developed. The method requires fewer computation steps than a previously known method.
Index Terms:
Walsh functions, Hadamard functions, image processing, orthogonal transforms, sequency (ordering)
Citation:
S.N. Srihari, M.K. Ohanesian, "An Efficient Algorithm for Determining Hadamard Sequency Vectors," IEEE Transactions on Computers, vol. 28, no. 3, pp. 243-244, March 1979, doi:10.1109/TC.1979.1675325
Usage of this product signifies your acceptance of the Terms of Use.