Suchergebnisse - "Multiplication algorithm"

  1. 1

    LSHIM: Low-Power and Small-Area Inexact Multiplier for High-Speed Error-Resilient Applications von Izadi, Azin, Jamshidi, Vahid

    ISSN: 2156-3357, 2156-3365
    Veröffentlicht: Piscataway IEEE 01.03.2025
    “… Numerical computations in various applications can often tolerate a small degree of error. In fields such as data mining, encoding algorithms, image …”
    Volltext
    Journal Article
  2. 2

    Matrix black box algorithms - a survey von Respondek, Jerzy

    ISSN: 2300-1917, 2300-1917
    Veröffentlicht: Polish Academy of Sciences 01.04.2022
    “… The implementations of matrix multiplication on contemporary, vector-oriented, and multicore-oriented computer hardware are very carefully designed and …”
    Volltext
    Journal Article
  3. 3

    The specifics of the Galois field GF(257) and its use for digital signal processing von Bakirov, Akhat, Matrassulova, Dinara, Vitulyova, Yelizaveta, Shaltykova, Dina, Suleimenov, Ibragim

    ISSN: 2045-2322, 2045-2322
    Veröffentlicht: London Nature Publishing Group UK 04.07.2024
    Veröffentlicht in Scientific reports (04.07.2024)
    “… An algorithm of digital logarithm calculation for the Galois field G F ( 257 ) is proposed. It is shown that this field is coupled with one of the most …”
    Volltext
    Journal Article
  4. 4

    LHTAM: Low-power and high-speed approximate multiplier for tiny inexact computing systems von Izadi, Azin, Jamshidi, Vahid

    ISSN: 0045-7906
    Veröffentlicht: Elsevier Ltd 01.04.2025
    Veröffentlicht in Computers & electrical engineering (01.04.2025)
    “… The numerical computations related to certain applications can usually withstand a small amount of error. So in these types of applications, such as data …”
    Volltext
    Journal Article
  5. 5

    Design and implementation of multiplication algorithm in quantum-dot cellular automata with energy dissipation analysis von Kamrani, Hamed, Heikalabad, Saeed Rasouli

    ISSN: 0920-8542, 1573-0484
    Veröffentlicht: New York Springer US 01.06.2021
    Veröffentlicht in The Journal of supercomputing (01.06.2021)
    “… QCA is an emerging nanotechnology for the design of digital system circuits based on electron interactions. QCA is used to design nanoscale circuits …”
    Volltext
    Journal Article
  6. 6

    Graded Computing von Rustem R. Aidagulov, Sergei T. Glavatsky

    ISSN: 2411-1473
    Veröffentlicht: The Fund for Promotion of Internet media, IT education, human development «League Internet Media 01.07.2019
    “… Calculations with a large amount of data (or data of a large dimension) are usually reduced to sets of calculations with fairly small amounts of them. One of …”
    Volltext
    Journal Article
  7. 7

    Instruction Sequences Expressing Multiplication Algorithms von Bergstra, J A, Middelburg, C A

    ISSN: 1843-8121, 2248-2695
    Veröffentlicht: Iasi Alexandru Ioan Cuza University of Iasi 01.01.2018
    Veröffentlicht in Scientific annals of computer science (01.01.2018)
    “… For each function on bit strings, its restriction to bit strings of any given length can be computed by a finite instruction sequence that contains only …”
    Volltext
    Journal Article
  8. 8

    Construction of asymmetric Chudnovsky-type algorithms for multiplication in finite fields von Ballet, Stéphane, Baudru, Nicolas, Bonnecaze, Alexis, Tukumuli, Mila

    ISSN: 0925-1022, 1573-7586
    Veröffentlicht: New York Springer US 01.12.2022
    Veröffentlicht in Designs, codes, and cryptography (01.12.2022)
    “… The original algorithm of D.V. Chudnovsky and G.V. Chudnovsky for the multiplication in extensions of finite fields provides a bilinear complexity which is …”
    Volltext
    Journal Article
  9. 9

    Multiplication Algorithm Based on Collatz Function von Barina, David

    ISSN: 1432-4350, 1433-0490
    Veröffentlicht: New York Springer US 01.11.2020
    Veröffentlicht in Theory of computing systems (01.11.2020)
    “… This article presents a new multiplication algorithm based on the Collatz function. Assuming the validity of the Collatz conjecture, the time complexity of …”
    Volltext
    Journal Article
  10. 10

    Hadoop-based framework for big data analysis of synchronised harmonics in active distribution network von Cao, Zijian, Lin, Jin, Wan, Can, Song, Yonghua, Taylor, Gareth, Li, Maozhen

    ISSN: 1751-8687, 1751-8695
    Veröffentlicht: The Institution of Engineering and Technology 09.11.2017
    Veröffentlicht in IET generation, transmission & distribution (09.11.2017)
    “… Synchronised harmonic analysis that utilises GPS signals to synchronise harmonic measurements enables advanced power quality analysis in smart grid. However, …”
    Volltext
    Journal Article
  11. 11

    Physically Aware Affinity-Driven Multiplier Implementation von Maltabashi, Or, Kra, Yehuda, Teman, Adam

    ISSN: 0278-0070, 1937-4151
    Veröffentlicht: New York IEEE 01.10.2020
    “… Optimized hardware for the execution of large dot-product (DP) calculations is central to many of today's integrated circuits. These arithmetic blocks are …”
    Volltext
    Journal Article
  12. 12

    An Improved wNAF Scalar-Multiplication Algorithm With Low Computational Complexity by Using Prime Precomputation von Hai, Huang, Ning, Na, Lin, Xing, Zhiwei, Liu, Bin, Yu, Shilei, Zhao

    ISSN: 2169-3536, 2169-3536
    Veröffentlicht: IEEE 2021
    Veröffentlicht in IEEE access (2021)
    “… To reduce the computational complexity of scalar multiplication, an improved wNAF scalar-multiplication algorithm is proposed by using prime precomputation. It …”
    Volltext
    Journal Article
  13. 13

    Digit-Level Serial-In Parallel-Out Multiplier Using Redundant Representation for a Class of Finite Fields von Namin, Parham Hosseinzadeh, Muscedere, Roberto, Ahmadi, Majid

    ISSN: 1063-8210, 1557-9999
    Veröffentlicht: New York IEEE 01.05.2017
    “… Two digit-level finite field multipliers in F 2 m using redundant representation are presented. Embedding F 2 m in cyclotomic field F 2 (n) causes a certain …”
    Volltext
    Journal Article
  14. 14

    Efficient digit-serial modular multiplication algorithm on FPGA von Pan, Jeng-Shyang, Song, Pengfei, Yang, Chun-Sheng

    ISSN: 1751-858X, 1751-8598, 1751-8598
    Veröffentlicht: Stevenage The Institution of Engineering and Technology 01.09.2018
    Veröffentlicht in IET circuits, devices & systems (01.09.2018)
    “… For cryptographic applications, such as DSA, RSA and ECC systems, the crypto-processors are required to perform modular multiplication (MM) on large integers …”
    Volltext
    Journal Article
  15. 15

    Design of high-speed, low-power, and area-efficient FIR filters von Liacha, Ahmed, Oudjida, Abdelkrim K, Ferguene, Farid, Bakiri, Mohammed, Berrandjia, Mohamed L

    ISSN: 1751-858X, 1751-8598, 1751-8598
    Veröffentlicht: Stevenage The Institution of Engineering and Technology 01.01.2018
    Veröffentlicht in IET circuits, devices & systems (01.01.2018)
    “… In a recent work, we have introduced a new multiple constant multiplication (MCM) algorithm, denoted as RADIX-2r. The latter exhibits the best results in speed …”
    Volltext
    Journal Article
  16. 16

    Multi-Stage Memory Efficient Strassen's Matrix Multiplication on GPU von Krishnan, Arjun Gopala, Goswami, Dhrubajyoti

    ISSN: 2640-0316
    Veröffentlicht: IEEE 01.12.2021
    “… Prior implementations of Strassen's matrix multiplication algorithm on GPUs traded additional workspace in the form of global memory or registers for time …”
    Volltext
    Tagungsbericht
  17. 17

    Bit‐parallel systolic multiplier over GF(2m) for irreducible trinomials with ASIC and FPGA implementations von Mathe, Sudha Ellison, Boppana, Lakshmi

    ISSN: 1751-8598, 1751-858X, 1751-8598
    Veröffentlicht: Stevenage The Institution of Engineering and Technology 01.07.2018
    Veröffentlicht in IET circuits, devices & systems (01.07.2018)
    “… Cryptography in digital world must offer integrity and confidentiality using cryptographic algorithms which mainly involve multiplication operation in finite …”
    Volltext
    Journal Article
  18. 18

    Bilinear complexity of algebras and the Chudnovsky–Chudnovsky interpolation method von Randriambololona, Hugues

    ISSN: 0885-064X, 1090-2708
    Veröffentlicht: Elsevier Inc 01.08.2012
    Veröffentlicht in Journal of Complexity (01.08.2012)
    “… We give new improvements to the Chudnovsky–Chudnovsky method that provides upper bounds on the bilinear complexity of multiplication in extensions of finite …”
    Volltext
    Journal Article
  19. 19

    Scalar Multiplication Algorithm Resisting Power Analysis Attacks Using NAF with Threshold Window von GU Jianguang

    ISSN: 1000-3428
    Veröffentlicht: Editorial Office of Computer Engineering 01.08.2019
    Veröffentlicht in Ji suan ji gong cheng (01.08.2019)
    “… In order to give consideration to the safety and efficiency of scalar multiplication in resource limited security chip,an Elliptic Curve Cryptography(ECC) …”
    Volltext
    Journal Article
  20. 20

    Why do 'fast' multiplication algorithms work? Opportunities for understanding within younger children via geometric pedagogy von Tisdell, Christopher C.

    ISSN: 0020-739X, 1464-5211
    Veröffentlicht: London Taylor & Francis 21.04.2021
    “… The purpose of this work is to explore alternative geometric pedagogical perspectives concerning justifications to 'fast' multiplication algorithms in a way …”
    Volltext
    Journal Article