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.
Dear experts here,
I am facing some problem in the following qns. I need some guidance on this qns.
In a CSMA based random access system, Poisson process is considered to be a good model for aggregated traffic for a large number of similar users. In such a system, the probability of n terminals...
Dear experts here,
I am facing some problem in the following qns. I need some guidance on this qns.
In a CSMA based random access system, Poisson process is considered to be a good model for aggregated traffic for a large number of similar users. In such a system, the probability of n terminals...
Hello guys,
how to solve this question?
For a cylic code, if an error pattern e(x) is detectable. show that its i cyclic shift e^(i) (x) is also detectable.
I was thinking this...
s(x) = r(x) mod g(x)
then look up the syndrome table, to find the error pattern.
What puzzled me is,
If let...
Communication channels
Any experts in communications/information theory can help me on this?
Consider a fiber optic communication channel with cross over probability of 10^-2 and a wireless mobile channel with erasure probability of 10^-2. Calculate the mutual information assuming equiprobable...
Dear guys.
I would like to understand more on fixed length code.
May I ask why the use of a fixed length code for N equiprobable symbols is as efficient as any code can be? What conditions have to be satisfied by N and codeword length so that the coding efficiency is 100%?
Thank you
This site uses cookies to help personalise content, tailor your experience and to keep you logged in if you register.
By continuing to use this site, you are consenting to our use of cookies.
