代码搜索：Bit
找到约 10,000 项符合「Bit」的源代码
代码结果 10,000
www.eeworm.com/read/445950/7587650
c bit_xor.c
#include
void main ()
{
printf("0 ^ 0 is %d\n", 0 ^ 0);
printf("0 ^ 1 is %d\n", 0 ^ 1);
printf("1 ^ 1 is %d\n", 1 ^ 1);
printf("1 ^ 2 is %d\n", 1 ^ 2);
printf("15 ^
www.eeworm.com/read/445950/7587661
c bit_inv.c
#include
void main ()
{
int value = 0xFF;
printf("The inverse of %X is %X\n", value, ~value);
}
www.eeworm.com/read/445908/7588246
bit emif_com.bit
www.eeworm.com/read/445133/7598679
java sum_of_bit.java
/**
* @(#)Sum_of_Bit.java
*
*
* @author
* @version 1.00 2009/3/1
*/
/**
*本程序的功能是求得一个0到1000范围的整数的各位上的数字和
*基本思路是用模(%)和除(/)的运算来实现
*/
import javax.swing.JOptionPane;
public class Su
www.eeworm.com/read/445133/7598680
class sum_of_bit.class
www.eeworm.com/read/440501/7688588
m bit_gen.m
%gives the complex fade coefficients
%output power is approximately unity
%inputs:max_doppler_freq (Hz); sample_freq (Hz); num_samples
function [bit_vec] = bit_gen(num_bits, seed)
rand(
www.eeworm.com/read/438335/7732701
m encode_bit.m
function [output, state] = encode_bit(g, input, state)
[n,k] = size(g);
m = k-1;
for i=1:n
output(i) = g(i,1)*input;
for j = 2:k
output(i) = xor(output(i),g(i,j)*state(j-1));
end
www.eeworm.com/read/437728/7741833
m encode_bit.m
function [output, state] = encode_bit(g, input, state)
% Copyright 1996 Matthew C. Valenti
% MPRG lab, Virginia Tech
% for academic use only
% This function takes as an input a single bit to be encod
www.eeworm.com/read/436250/7774051
c bit_xor.c
#include
void main ()
{
printf("0 ^ 0 is %d\n", 0 ^ 0);
printf("0 ^ 1 is %d\n", 0 ^ 1);
printf("1 ^ 1 is %d\n", 1 ^ 1);
printf("1 ^ 2 is %d\n", 1 ^ 2);
printf("15 ^
www.eeworm.com/read/436250/7774062
c bit_inv.c
#include
void main ()
{
int value = 0xFF;
printf("The inverse of %X is %X\n", value, ~value);
}