Swapna Banerjee

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Koushik Maharatna

> Home > Persons > Swapna Banerjee

Publications

2005
[j6]
- view
  authority control:
- export record
  dblp key:
  - journals/tcsv/MaharatnaBGKT05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcsv/MaharatnaBGKT05
Koushik Maharatna, Swapna Banerjee, Eckhard Grass, Milos Krstic, Alfonso Troya:
Modified virtually scaling-free adaptive CORDIC rotator algorithm and architecture. IEEE Trans. Circuits Syst. Video Technol. 15(11): 1463-1474 (2005)
2004
[c13]
- view
  authority control:
- export record
  dblp key:
  - conf/pimrc/MaharatnaTBGK04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/pimrc/MaharatnaTBGK04
Koushik Maharatna, Alfonso Troya, Swapna Banerjee, Eckhard Grass, Milos Krstic:
A 16-bit CORDIC rotator for high-speed wireless LAN. PIMRC 2004: 1747-1751
2001
[j4]
- view
  authority control:
- export record
  dblp key:
  - journals/pr/MaharatnaB01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/pr/MaharatnaB01
Koushik Maharatna, Swapna Banerjee:
A VLSI array architecture for Hough transform. Pattern Recognit. 34(7): 1503-1512 (2001)
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/sigpro/MaharatnaDB01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/sigpro/MaharatnaDB01
Koushik Maharatna, A. S. Dhar, Swapna Banerjee:
A VLSI array architecture for realization of DFT, DHT, DCT and DST. Signal Process. 81(9): 1813-1822 (2001)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.