SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(Öwall Anders) "

Sökning: WFRF:(Öwall Anders)

  • Resultat 1-10 av 24
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  •  
2.
  •  
3.
  • Berkeman, Anders, et al. (författare)
  • A configurable divider using digit recurrence
  • 2003
  • Ingår i: Proceedings - IEEE International Symposium on Circuits and Systems. - 2158-1525 .- 0271-4310. ; 5, s. 333-336
  • Konferensbidrag (refereegranskat)abstract
    • The division operation is essential in many digital signal processing algorithms. For a hardware implementation, the requirements and constraints on the divider circuit differ significantly with different applications. Therefore, it is not possible to design one divider component having optimal performance and cost for all target applications. Instead, the presented divider has a modular architecture, based on instantiation of small efficient divider sub-blocks. The configuration of the divider architecture is set by a number of parameters controlling wordlength, number of quotient bits, number of clock cycles per operation, and fixed or floating point operation. Digit recurrence algorithms with carry save arithmetic and on-the-fly two's complement output quotient conversion are used to make the sub-blocks small, fast and power efficient, The modularity gives the designer freedom to elaborate different parameters to explore the design space. Two applications using the proposed divider are presented. Furthermore, an example divider circuit has been fabricated and performance measurements are included.
  •  
4.
  •  
5.
  • Berkeman, Anders, et al. (författare)
  • A low logic depth complex multiplier
  • 1998
  • Ingår i: ; , s. 204-207
  • Konferensbidrag (refereegranskat)abstract
    • A complex multiplier has been designed for use in a pipelined fast fourier transform processor. The performance in terms of throughput of the processor is limited by the multiplication. Therefore, the multiplier is optimized to make the input to output delay as short as possible. A new architecture based on distributed arithmetic and Wallace-trees has been developed and is compared to a previous multiplier realized as a regular distributed arithmetic array. The simulated gain in speed for the presented multiplier is about 100%. For verification, the multiplier is fabricated in a three metal-layer 0.5µ CMOS process using a standard cell library. The fabricated multiplier chip has been functionally verified.
  •  
6.
  • Berkeman, Anders, et al. (författare)
  • A low logic depth complex multiplier using distributed arithmetic
  • 2000
  • Ingår i: IEEE Journal of Solid-State Circuits. - : Institute of Electrical and Electronics Engineers (IEEE). - 0018-9200 .- 1558-173X. ; 35:4, s. 656-659
  • Tidskriftsartikel (refereegranskat)abstract
    • A combinatorial complex multiplier has been designed for use in a pipelined fast Fourier transform processor. The performance in terms of throughput of the processor is limited by the multiplication. Therefore, the multiplier is optimized to make the input-to-output delay as short as possible. A new architecture based on distributed arithmetic, Wallace-trees, and carry-lookahead adders has been developed. The multiplier has been fabricated using standard cells in a 0.5-μm process and verified for functionality, speed, and power consumption. Running at 40 MHz, a multiplier with input wordlengths of 16+16 times 10+10 bits consumes 54% less power compared to an distributed arithmetic array multiplier fabricated under equal conditions
  •  
7.
  •  
8.
  •  
9.
  • Berkeman, Anders, et al. (författare)
  • Co-optimization of FFT and FIR in a delayless acoustic echo canceller implementation
  • 2000
  • Ingår i: [Host publication title missing]. - 0780354826 ; 5, s. 241-244
  • Konferensbidrag (refereegranskat)abstract
    • In application specific implementation of digital signal processing algorithms optimization is important for a low power solution, not only on block level but also between blocks. This paper presents a co-optimization of a fast Fourier transform and a finite impulse response filter in a silicon implementation of an acoustic echo. The optimization gain can be measured in the number of operations and memory accesses performed per second, and therefore processing power. The optimization can also be applied to other algorithms with a similar constellation of Fourier transforms and finite impulse response filters
  •  
10.
  • Berkeman, Anders, et al. (författare)
  • Implementation Issues for acoustic echo cancellers
  • 1999
  • Ingår i: [Host publication title missing]. - 0780354915 ; , s. 97-100
  • Konferensbidrag (refereegranskat)abstract
    • The high computational complexity of acoustic echo cancellation algorithms requires application specific implementations to sustain real time signal processing with affordable power consumption. This is especially true for systems where a delayless approach is considered important, e.g. wireless communication systems. The proposed paper presents architectural considerations to reach a feasible hardware solution.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-10 av 24

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy