skip to main content
Visitante
Meu Espaço
Minha Conta
Sair
Identificação
This feature requires javascript
Tags
Revistas Eletrônicas (eJournals)
Livros Eletrônicos (eBooks)
Bases de Dados
Bibliotecas USP
Ajuda
Ajuda
Idioma:
Inglês
Espanhol
Português
This feature required javascript
This feature requires javascript
Primo Search
Busca Geral
Busca Geral
Acervo Físico
Acervo Físico
Produção Intelectual da USP
Produção USP
Search For:
Clear Search Box
Search in:
Busca Geral
Or hit Enter to replace search target
Or select another collection:
Search in:
Busca Geral
Busca Avançada
Busca por Índices
This feature requires javascript
This feature requires javascript
Some Notes on the Walsh Functions
Henderson, Keith W.
IEEE transactions on electronic computers, 1964-02, Vol.EC-13 (1), p.50-52
[Periódico revisado por pares]
IEEE
Texto completo disponível
Citações
Citado por
Exibir Online
Detalhes
Resenhas & Tags
Mais Opções
Nº de Citações
This feature requires javascript
Enviar para
Adicionar ao Meu Espaço
Remover do Meu Espaço
E-mail (máximo 30 registros por vez)
Imprimir
Link permanente
Referência
EasyBib
EndNote
RefWorks
del.icio.us
Exportar RIS
Exportar BibTeX
This feature requires javascript
Título:
Some Notes on the Walsh Functions
Autor:
Henderson, Keith W.
Assuntos:
Analog computers
;
Binary codes
;
Capacitors
;
Computer errors
;
Concurrent computing
;
Moon
;
Orbits
;
Output feedback
;
Resistors
;
Vehicle dynamics
É parte de:
IEEE transactions on electronic computers, 1964-02, Vol.EC-13 (1), p.50-52
Descrição:
The complete set of orthogonal functions of binary variables called Walsh functions can be obtained as direct products of the subclass of these functions known as Rademacher functions. The complete set of Walsh functions can be conveniently represented by a square matrix of l's and -1's, which, when normalized, is an orthogonal matrix. The correct Rademacher functions to multiply together to obtain a specified Walsh function can be determined without the use of recursion formulas by reference to a simple modification of the reflected binary code. A binary equivalent of the Walsh matrix, consisting of 0's and 1's, can be generated directly by multiplying together, modulo 2, two simpler matrices easily obtained from the reflected binary code and natural binary code, respectively. A modified Walsh matrix that has a simple recursive structure can be obtained by rearranging the rows of the fundamental Walsh matrix. A binary equlivalent of thle former can also be generated directly by multiplying together, modulo 2, two simpler matrices easily obtained from the natural binary code alone. A transformation matrix for direct conversion of the Walsh matrix from its fundamental to modified (or modified to fundamental) form can be written by observing how the rows of the natural binary code are rearranged to form the modified reflected binary code.
Editor:
IEEE
Idioma:
Inglês
This feature requires javascript
This feature requires javascript
Voltar para lista de resultados
This feature requires javascript
This feature requires javascript
Buscando em bases de dados remotas. Favor aguardar.
Buscando por
em
scope:(USP_VIDEOS),scope:("PRIMO"),scope:(USP_FISICO),scope:(USP_EREVISTAS),scope:(USP),scope:(USP_EBOOKS),scope:(USP_PRODUCAO),primo_central_multiple_fe
Mostrar o que foi encontrado até o momento
This feature requires javascript
This feature requires javascript