In a signed binary in two's complement representation, the first bit (the leftmost) indicates the sign, 1 = negative, 0 = positive.
2. Get the binary representation in one's complement.
* Run this step only if the number is negative *
Note on binary subtraction rules:
11 - 1 = 10; 10 - 1 = 1; 1 - 0 = 1; 1 - 1 = 0.
Subtract 1 from the initial binary number.
1101 1110 1010 0011 0100 1111 0000 1110 1101 1110 1101 1011 0001 0100 1011 0000 - 1 = 1101 1110 1010 0011 0100 1111 0000 1110 1101 1110 1101 1011 0001 0100 1010 1111
3. Get the binary representation of the positive (unsigned) number.
* Run this step only if the number is negative *
Flip all the bits of the signed binary in one's complement representation (reverse the digits) - replace the bits set on 1 with 0s and the bits on 0 with 1s:
!(1101 1110 1010 0011 0100 1111 0000 1110 1101 1110 1101 1011 0001 0100 1010 1111) = 0010 0001 0101 1100 1011 0000 1111 0001 0010 0001 0010 0100 1110 1011 0101 0000
4. Map the unsigned binary number's digits versus the corresponding powers of 2 that their place value represent:
263
0 262
0 261
1 260
0 259
0 258
0 257
0 256
1 255
0 254
1 253
0 252
1 251
1 250
1 249
0 248
0 247
1 246
0 245
1 244
1 243
0 242
0 241
0 240
0 239
1 238
1 237
1 236
1 235
0 234
0 233
0 232
1 231
0 230
0 229
1 228
0 227
0 226
0 225
0 224
1 223
0 222
0 221
1 220
0 219
0 218
1 217
0 216
0 215
1 214
1 213
1 212
0 211
1 210
0 29
1 28
1 27
0 26
1 25
0 24
1 23
0 22
0 21
0 20
0
5. Multiply each bit by its corresponding power of 2 and add all the terms up.
0010 0001 0101 1100 1011 0000 1111 0001 0010 0001 0010 0100 1110 1011 0101 0000(2) =
(0 × 263 + 0 × 262 + 1 × 261 + 0 × 260 + 0 × 259 + 0 × 258 + 0 × 257 + 1 × 256 + 0 × 255 + 1 × 254 + 0 × 253 + 1 × 252 + 1 × 251 + 1 × 250 + 0 × 249 + 0 × 248 + 1 × 247 + 0 × 246 + 1 × 245 + 1 × 244 + 0 × 243 + 0 × 242 + 0 × 241 + 0 × 240 + 1 × 239 + 1 × 238 + 1 × 237 + 1 × 236 + 0 × 235 + 0 × 234 + 0 × 233 + 1 × 232 + 0 × 231 + 0 × 230 + 1 × 229 + 0 × 228 + 0 × 227 + 0 × 226 + 0 × 225 + 1 × 224 + 0 × 223 + 0 × 222 + 1 × 221 + 0 × 220 + 0 × 219 + 1 × 218 + 0 × 217 + 0 × 216 + 1 × 215 + 1 × 214 + 1 × 213 + 0 × 212 + 1 × 211 + 0 × 210 + 1 × 29 + 1 × 28 + 0 × 27 + 1 × 26 + 0 × 25 + 1 × 24 + 0 × 23 + 0 × 22 + 0 × 21 + 0 × 20)(10) =
(0 + 0 + 2 305 843 009 213 693 952 + 0 + 0 + 0 + 0 + 72 057 594 037 927 936 + 0 + 18 014 398 509 481 984 + 0 + 4 503 599 627 370 496 + 2 251 799 813 685 248 + 1 125 899 906 842 624 + 0 + 0 + 140 737 488 355 328 + 0 + 35 184 372 088 832 + 17 592 186 044 416 + 0 + 0 + 0 + 0 + 549 755 813 888 + 274 877 906 944 + 137 438 953 472 + 68 719 476 736 + 0 + 0 + 0 + 4 294 967 296 + 0 + 0 + 536 870 912 + 0 + 0 + 0 + 0 + 16 777 216 + 0 + 0 + 2 097 152 + 0 + 0 + 262 144 + 0 + 0 + 32 768 + 16 384 + 8 192 + 0 + 2 048 + 0 + 512 + 256 + 0 + 64 + 0 + 16 + 0 + 0 + 0 + 0)(10) =
(2 305 843 009 213 693 952 + 72 057 594 037 927 936 + 18 014 398 509 481 984 + 4 503 599 627 370 496 + 2 251 799 813 685 248 + 1 125 899 906 842 624 + 140 737 488 355 328 + 35 184 372 088 832 + 17 592 186 044 416 + 549 755 813 888 + 274 877 906 944 + 137 438 953 472 + 68 719 476 736 + 4 294 967 296 + 536 870 912 + 16 777 216 + 2 097 152 + 262 144 + 32 768 + 16 384 + 8 192 + 2 048 + 512 + 256 + 64 + 16)(10) =
2 403 990 850 798 676 816(10)
6. If needed, adjust the sign of the integer number by the first digit (leftmost) of the signed binary:
1101 1110 1010 0011 0100 1111 0000 1110 1101 1110 1101 1011 0001 0100 1011 0000(2) = -2 403 990 850 798 676 816(10)
The signed binary number in two's complement representation 1101 1110 1010 0011 0100 1111 0000 1110 1101 1110 1101 1011 0001 0100 1011 0000(2) converted and written as an integer in decimal system (base ten):
1101 1110 1010 0011 0100 1111 0000 1110 1101 1110 1101 1011 0001 0100 1011 0000(2) = -2 403 990 850 798 676 816(10)
Spaces were used to group digits: for binary, by 4, for decimal, by 3.