mahaveer hanuman

2011 年からアクティブ

Followers: 0 Following: 0

メッセージ

統計

Feeds

質問

Getting parity
num = 100; source = randint(num,2); it is a 2x100 i should first row elements and j should be 2nd row elemntshow can i do it ...

14年以上前 | 2 件の回答 | 0

2

回答

回答済み
for loop
num = 100; source = randint(num,2); i =num(1,:); j =num(2,:); parity = mod(source(i)+ source(j),2); index out of bound...

14年以上前 | 0

質問

for loop
i have a=2x10 i need to use second row element how can i do it i=1:length(a) i get elements of first row then how abt seco...

14年以上前 | 2 件の回答 | 0

2

回答

質問

soft decision code
I need to submite my project on 30th of this month on softdecision code .So can one say where can i get this and how can i do it...

14年以上前 | 1 件の回答 | 0

1

回答

質問

count
I have g(45x2)and I(45x2) i want to compare each and every row of g with I(45x2) and count them are equal

14年以上前 | 1 件の回答 | 0

1

回答

質問

for loop
i have G={[1 0 1;1 0 0;0 0 1;1 1 1] and out put should be I={[1 0;1 0; 0 0;1 1]} how can i get using for loop

14年以上前 | 2 件の回答 | 0

2

回答

質問

compare
G=[1 0]with I={[1 0;1 1;0 0;1 0;1 1;0 1;1 0 random sequence]} i need to compare them and count number of matched bits

14年以上前 | 2 件の回答 | 0

2

回答

質問

counter
i have b={[1 0][0 0][0 1][1 1]...30 }and I={[0 1][1 0][ 0 0][0 1]......30bits} how can i compare b with I using counter

14年以上前 | 1 件の回答 | 0

1

回答

質問

XOR operation
I=rand(1,N)>0.5 N=90 xor operation should done for each two bits . and out put should be corresponding two bit followed with r...

14年以上前 | 2 件の回答 | 0

2

回答

質問

counter
I=[1 0;1 1;1 0;0 0;0 1;1 1;........90bits]S=[0 1]now i need to calculate bit error =(counter/I); i need to compare S with I ...

14年以上前 | 1 件の回答 | 0

1

回答

質問

if else
i need to compare s=[0 1] with I=[0 0;1 1;1 0;0 1;1 0;0 0; 1 0; 1 1; 0 0;.............................90bits] i want to use coun...

14年以上前 | 2 件の回答 | 0

2

回答

質問

bit mapping
lets A =[ 1 1 0 after dng some steps i got z=[ 0.2345 1 0 1 1.456 0 ...

14年以上前 | 1 件の回答 | 0

1

回答

質問

euclidean distance,output
we compute the euclidean distance for each received word as follows: * 010 ---> 0.154 * 011 ---> 0.256 * 100 ---> ...

14年以上前 | 2 件の回答 | 0

2

回答

質問

reshaping
i have A= 1 0 1 0 0 0 1 and B= 1 1 1 0 0 0 1 now i need to make it as s= 1 1 0 1 1 1 0 0 0 0 0 0 ...

14年以上前 | 2 件の回答 | 0

2

回答

質問

column addding
i mean i have: y= 1 2 5 3 5 7 2 6 4 x= 1 -2 7 x= 3 5 4 x= 2 -6 2 now i need output as: z=(1-1)^2+(2+2)^2+(5-7...

14年以上前 | 1 件の回答 | 0

1

回答

質問

column wise adding
i had y= 1 6 4 7 5 3 6 4 9 n so on... i want yout=1+6+4 7+5+3 6+4+9

14年以上前 | 1 件の回答 | 0

1

回答

質問

dividing stream
i have bit stream of 30 bit y= 1 0 1 0 0 0 1 1 1 1 1 0.......... i need to make it as y(0)=1 0 1 y(1)= 0 0 0 y(2)= 1 1 1 ...

14年以上前 | 1 件の回答 | 0

1

回答

質問

adding noise
x='+1' '+1' '-1' '+1' . . . . how to add awgn to x

14年以上前 | 1 件の回答 | 0

1

回答

質問

adding noise
w=[1 0 1 1 1 0 0 0 0.............] some bit stream i need to add AWGN noise whoes SNR ranges from 0db to 10db. and plotting (w v...

14年以上前 | 0 件の回答 | 0

0

回答

質問

db values
how can i use 0db to 10db in signal to noise ratio in AWGN

14年以上前 | 0 件の回答 | 0

0

回答

質問

conversion
how can we convert scalar to vector

14年以上前 | 3 件の回答 | 0

3

回答

質問

sbit stream
w= 1 0 1 w= 0 1 1 w= 0 1 0 how came this can be written in straight line w= 1 0 1 0 1 1 0 1 0

14年以上前 | 2 件の回答 | 0

2

回答

回答済み
bit flipping
eg:c=[1 0 1 1 1 0 1 0 0 0 1 1 1 0 1 0 1 0 1 1 0 1 0 1 1 1 0 1 0 1 0 1 0 1 0 1] in every 6th element should change to 1 to 0 ...

14年以上前 | 0

質問

bit flipping
[EDIT: Thu May 12 23:15:24 UTC 2011 Duplicate Removed - MKF] a=[0 1 1 0 1 0 1 0 1 0 1 1 1 1 ................]=30 bits how to ...

14年以上前 | 3 件の回答 | 0

3

回答

回答済み
bpsk
thanks its works

14年以上前 | 0

質問

bpsk
sir how to convert 0 to -1 and 1 to +1

14年以上前 | 2 件の回答 | 0

2

回答

質問

XOR operation
input=output [0 0]=[0 0 0] [0 1]=[0 1 1] [1 0]=[1 0 1] [1 1]=[1 1 0] how can i get this

15年弱前 | 1 件の回答 | 0

1

回答