Continue to Site

Welcome to EDAboard.com

Welcome to our site! EDAboard.com is an international Electronics Discussion Forum focused on EDA software, circuits, schematics, books, theory, papers, asic, pld, 8051, DSP, Network, RF, Analog Design, PCB, Service Manuals... and a whole lot more! To participate you need to register. Registration is free. Click here to register now.

Need solution to questions from book-wireless communication

Status
Not open for further replies.

maree

Newbie level 2
Joined
May 21, 2009
Messages
2
Helped
0
Reputation
0
Reaction score
0
Trophy points
1,281
Activity points
1,299
solution??

if any body has solution for these questions these questions are from book "wireless communication"
1) All Hamming codes have a minimum distance of 3. What is the error-correction and error-detection capability of a Hamming code?


2) The (15,11) Hamming code has generator polynomial g(X)=1+ X + X4. Determine if the codewords described by polynomials c1(X)=1+X+X3 +X7 and c2(X)=1+X3 +X5 +X6 are valid codewords for this generator polynomial. Also find the systematic form of this polynomial p(X)+ Xn−ku(X) that generates the codewords in systematic form.

3) The (7,4) cyclic Hamming code has a generator polynomial g(X)=1+ X2 + X3.
(a) Find the generator matrix for this code in systematic form.
(b) Find the parity check matrix for the code.
(c) Suppose the codeword C = [1011010] is transmitted through a channel and the corresponding received codeword is C = [1010011]. Find the syndrome polynomial associated with this received codeword.
(d) Find all possible received codewords such that for transmitted codeword C = [1011010], the received codeword has a syndrome polynomial of zero
 

Status
Not open for further replies.

Similar threads

Part and Inventory Search

Welcome to EDABoard.com

Sponsor

Back
Top