1 resultado para high-speed induction machine
em Universidade Complutense de Madrid
Filtro por publicador
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (5)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (2)
- Aquatic Commons (3)
- Archive of European Integration (4)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (6)
- Aston University Research Archive (49)
- Biblioteca de Teses e Dissertações da USP (1)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (4)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (2)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (3)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (9)
- Bucknell University Digital Commons - Pensilvania - USA (3)
- CaltechTHESIS (17)
- Cambridge University Engineering Department Publications Database (134)
- CentAUR: Central Archive University of Reading - UK (19)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (106)
- Cochin University of Science & Technology (CUSAT), India (3)
- CORA - Cork Open Research Archive - University College Cork - Ireland (4)
- CUNY Academic Works (1)
- Dalarna University College Electronic Archive (1)
- Deakin Research Online - Australia (36)
- Digital Commons - Michigan Tech (3)
- Digital Commons at Florida International University (1)
- Digital Peer Publishing (1)
- Doria (National Library of Finland DSpace Services) - National Library of Finland, Finland (1)
- DRUM (Digital Repository at the University of Maryland) (2)
- Duke University (2)
- Greenwich Academic Literature Archive - UK (4)
- Helda - Digital Repository of University of Helsinki (1)
- Illinois Digital Environment for Access to Learning and Scholarship Repository (2)
- Indian Institute of Science - Bangalore - Índia (146)
- INSTITUTO DE PESQUISAS ENERGÉTICAS E NUCLEARES (IPEN) - Repositório Digital da Produção Técnico Científica - BibliotecaTerezine Arantes Ferra (5)
- Instituto Politécnico do Porto, Portugal (2)
- Lume - Repositório Digital da Universidade Federal do Rio Grande do Sul (1)
- Martin Luther Universitat Halle Wittenberg, Germany (2)
- Massachusetts Institute of Technology (3)
- Memorial University Research Repository (1)
- National Center for Biotechnology Information - NCBI (1)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (2)
- QSpace: Queen's University - Canada (1)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (49)
- Queensland University of Technology - ePrints Archive (122)
- ReCiL - Repositório Científico Lusófona - Grupo Lusófona, Portugal (1)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (1)
- Repositório digital da Fundação Getúlio Vargas - FGV (1)
- Repositório Institucional da Universidade de Aveiro - Portugal (1)
- Repositório Institucional da Universidade Federal do Rio Grande - FURG (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (39)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (1)
- Universidad de Alicante (5)
- Universidad Politécnica de Madrid (62)
- Universidade Complutense de Madrid (1)
- Universidade Federal de Uberlândia (1)
- Universidade Federal do Rio Grande do Norte (UFRN) (6)
- Universitat de Girona, Spain (1)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (5)
- Université de Montréal, Canada (2)
- University of Michigan (33)
- University of Queensland eSpace - Australia (5)
- University of Washington (2)
- WestminsterResearch - UK (2)
Resumo:
Efficient hardware implementations of arithmetic operations in the Galois field are highly desirable for several applications, such as coding theory, computer algebra and cryptography. Among these operations, multiplication is of special interest because it is considered the most important building block. Therefore, high-speed algorithms and hardware architectures for computing multiplication are highly required. In this paper, bit-parallel polynomial basis multipliers over the binary field GF(2(m)) generated using type II irreducible pentanomials are considered. The multiplier here presented has the lowest time complexity known to date for similar multipliers based on this type of irreducible pentanomials.