Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 210,197,894 papers from all fields of science
Search
Sign In
Create Free Account
Sign bit
In computer science, the sign bit is a bit in a signed number representation that indicates the sign of a number. Although only signed numeric data…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
27 relations
Alpha 21064
Apollo Guidance Computer
Arithmetic shift
Bitwise operation
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2020
Highly Cited
2020
LSQ+: Improving low-bit quantization through learnable offsets and better initialization
Yash Bhalgat
,
Jinwon Lee
,
Markus Nagel
,
Tijmen Blankevoort
,
Nojun Kwak
IEEE/CVF Conference on Computer Vision and…
2020
Corpus ID: 216036085
Unlike ReLU, newer activation functions (like Swish, H-swish, Mish) that are frequently employed in popular efficient…
Expand
2016
2016
DOA Estimation From One-Bit Compressed Array Data via Joint Sparse Representation
Kai Yu
,
Yimin D. Zhang
,
Ming Bao
,
Y. Hu
,
Zhi Wang
IEEE Signal Processing Letters
2016
Corpus ID: 11607872
A one-bit joint sparse representation direction of arrival (OBJSR-DOA) estimation approach is proposed in this letter. By…
Expand
2013
2013
Minimum ranks of sign patterns via sign vectors and duality
M. Arav
,
Frank J. Hall
,
Zhongshan Li
,
H. Holst
,
J. Sinkovic
,
Lihua Zhang
2013
Corpus ID: 8286998
A {\it sign pattern matrix} is a matrix whose entries are from the set $\{+,-, 0\}$. The minimum rank of a sign pattern matrix $A…
Expand
Highly Cited
2013
Highly Cited
2013
Fast Reproducible Floating-Point Summation
J. Demmel
,
H. D. Nguyen
IEEE Symposium on Computer Arithmetic
2013
Corpus ID: 9853518
Reproducibility, i.e. getting the bitwise identical floating point results from multiple runs of the same program, is a property…
Expand
2011
2011
An Instant-Startup Jitter-Tolerant Manchester-Encoding Serializer/Deserializer Scheme for Event-Driven Bit-Serial LVDS Interchip AER Links
C. Zamarreño-Ramos
,
T. Serrano-Gotarredona
,
B. Linares-Barranco
IEEE Transactions on Circuits and Systems Part 1…
2011
Corpus ID: 24414705
This paper presents a serializer/deserializer scheme for asynchronous address event representation (AER) bit-serial interchip…
Expand
Highly Cited
2004
Highly Cited
2004
A novel trellis-shaping design with both peak and average power reduction for OFDM systems
H. Ochiai
IEEE Transactions on Communications
2004
Corpus ID: 32739660
A new trellis shaping design is proposed for reducing the peak-to-average power ratio of the bandlimited orthogonal frequency…
Expand
Highly Cited
2002
Highly Cited
2002
Evaluation of CORDIC Algorithms for FPGA Design
J. Valls-Coquillat
,
M. Kuhlmann
,
K. Parhi
J. VLSI Signal Process.
2002
Corpus ID: 5614024
This paper presents a study of the suitability for FPGA design of full custom based CORDIC implementations. Since all these…
Expand
Highly Cited
2000
Highly Cited
2000
Tms320c6000 cpu and instruction set reference guide
Junqiang Sun
2000
Corpus ID: 60571418
A force transmitting connection for interconnecting a pair of members to transmit force therebetween includes a pair of spaced…
Expand
1993
1993
Treatment of schizophrenic disorder, paranoid type, with intramuscular recombinant alpha-2b interferon
J. Gomez
,
J. R. Gutierrez
,
+11 authors
Y. Rivero
1993
Corpus ID: 71823486
Twenty patients meeting DSM-III criteria for Schizophrenic Disorder, Paranoid Type were studied. After a 30 day drug-free period…
Expand
Highly Cited
1975
Highly Cited
1975
The Sign/Logarithm Number System
E. Swartzlander
,
Aristides G. Alexopoulos
IEEE transactions on computers
1975
Corpus ID: 13232181
A signed logarithmic number system, which is capable of representing negative as well as positive numbers is described. A number…
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