Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,149,140 papers from all fields of science
Search
Sign In
Create Free Account
Bit-level parallelism
Known as:
Bitlevel parallelisms
, Bit-level devices
, Bit levels
Expand
Bit-level parallelism is a form of parallel computing based on increasing processor word size. From the advent of very-large-scale integration (VLSI…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
14 relations
16-bit
32-bit
4-bit
8-bit
Expand
Broader (1)
Parallel computing
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
A frequent-value based PRAM memory architecture
Guangyu Sun
,
Dimin Niu
,
Ouyang Jin
,
Yuan Xie
Asia and South Pacific Design Automation…
2011
Corpus ID: 16072514
Phase Change Random Access Memory (PRAM) has great potential as the replacement of DRAM as main memory, due to its advantages of…
Expand
Highly Cited
2009
Highly Cited
2009
Focal-Plane Algorithmically-Multiplying CMOS Computational Image Sensor
Alireza Nilchi
,
J. Aziz
,
R. Genov
IEEE Journal of Solid-State Circuits
2009
Corpus ID: 17015364
The CMOS image sensor computes two-dimensional convolution of video frames with a programmable digital kernel of up to 8 times 8…
Expand
Highly Cited
2005
Highly Cited
2005
Platform-based design from parallel C specifications
I. Augé
,
F. Pétrot
,
François Donnet
,
P. Gomez
IEEE Transactions on Computer-Aided Design of…
2005
Corpus ID: 18616300
This paper presents Disydent, a framework dedicated to system-on-a-chip (SoC) platform-based design for shared memory multiple…
Expand
Highly Cited
2002
Highly Cited
2002
Bluetooth and IEEE 802.11 coexistence: analytical performance evaluation in fading channel
A. Conti
,
D. Dardari
,
G. Pasolini
,
O. Andrisano
IEEE International Symposium on Personal, Indoor…
2002
Corpus ID: 7751042
The performance in terms of the mean packet error probability (PEP) in a Rayleigh fading channel with thermal noise is…
Expand
Highly Cited
2000
Highly Cited
2000
A multiple input-multiple output channel model for simulation of Tx- and Rx-diversity wireless systems
M. Stege
,
J. Jelitto
,
M. Bronzel
,
G. Fettweis
,
Mannesmann Mobilfunk
Vehicular Technology Conference Fall . IEEE VTS…
2000
Corpus ID: 17971886
Space-time receivers for wireless communication systems offer the possibility to have both Tx- and Rx-antennas. For a realistic…
Expand
Highly Cited
2000
Highly Cited
2000
A simple processor core design for DCT/IDCT
Tian-Sheuan Chang
,
Chin-Sheng Kung
,
C. Jen
IEEE Trans. Circuits Syst. Video Technol.
2000
Corpus ID: 12561673
This paper presents a cost-effective processor core design that features the simplest hardware and is suitable for discrete…
Expand
Highly Cited
1997
Highly Cited
1997
VLSI array algorithms and architectures for RSA modular multiplication
Y. Jeong
,
W. Burleson
IEEE Transactions on Very Large Scale Integration…
1997
Corpus ID: 36721067
We present two novel iterative algorithms and their array structures for integer modular multiplication. The algorithms are…
Expand
1996
1996
VLSI Implementation of a Selective Median Filter
Chun-Te Chen Chun-Te Chen
,
Liang-Gee Chen Liang-Gee Chen
. Digest of Technical Papers., International…
1996
Corpus ID: 31914935
0001 0 0 1 0 0011 0111 1001 In this paper, the VLSI implementation of a selective median filter for the real-time applications is…
Expand
Highly Cited
1987
Highly Cited
1987
Parallel bit-level pipelined VLSI designs for high-speed signal processing
M. Hatamian
,
G. Cash
Proceedings of the IEEE
1987
Corpus ID: 37959832
This paper explores the potential of bit-level pipelined VLSI for high-speed signal processing. We discuss issues involved in…
Expand
Highly Cited
1982
Highly Cited
1982
Completely iterative, pipelined multiplier array suitable for VLSI
J. McCanny
,
J. McWhirter
1982
Corpus ID: 60584950
A pipelined array multiplier which has been derived by applying 'systolic array' principles at the bit level is described…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE