Hi,
The difference could be because of the way the encoding is implemented. My
encoding scheme is very naive. And it need ***not*** necessarily be true
that the last K bits are the data bits. Here it happened, but the encoder
does not have anything to make sure of this in general. If the decoder i
OK here is my next question :-)
One of the other parity codes in P25 TDMA known as "ISCH" is a similar
"binary code" which the specs decribe as follows:
The Information field in the ISCH is 40 bits encoded with a
(40, 9,16) binary code.The (40, 9,16) code derived from a
(40,10,16) binary code
> Now I'm wondering why I didn't get any segmentation faults.
You should be able to reproduce this by loading the alist file from the
reference site
http://www.inference.phy.cam.ac.uk/mackay/codes/alist.html (that example may
not be a good LDPC example, but should at minimum cause a fault in u
Wow, interesting to read all about this. Thanks for all the good work. Miklos
On Wed, Nov 6, 2013 at 3:17 PM, Manu T S wrote:
> Hi Miklos,
>
> The implementation is quite slow. I don't have any quantitative performance
> measures, yet.
> Nevertheless I have some empirical measures. For example, o
Hi Miklos,
The implementation is quite slow. I don't have any quantitative performance
measures, yet.
Nevertheless I have some empirical measures. For example, on testing the
implementation (all C++ and no GNU Radio) with a (8000, 4000) code(rate
0.5, regular), in with AWGN of 0.8 added to it (cap
Hi Manu,
Thanks for the report, it was more informative than the presentation.
Yes, I have seen the BER figure, but that is not very will presented
(e.g. you should use logarithmic scale for BER) and should have better
resolution on the Eb/N0 axes. You write that it does not use VOLK or
SSE2. How
Dear Manu,
Do you have any performance numbers on your LDPC decoder? I could not
find any info, even in your presentation. Do you have also a BER
figure, or even better would be some technical report. I would love to
get some sense on the performance of your implementation.
Best,
Miklos
On Tue,
Dear Max,
You are correct. It is a bug. Now I'm wondering why I didn't get any
segmentation faults.
Probably I didn't get any segmentation faults because, after i = M - 1, EOF
has reached.
Thanks for the correction.
On Tue, Nov 5, 2013 at 9:14 PM, ikjtel wrote:
> Greetings
>
> I was very int
Greetings
I was very interested in this project for possible application to the op25
project, since P25 uses several FEC codes
including RS and other block codes. I've brought up the gr-ldpc library and
have a few questions. Due to the hateful YAhoo mail composer, I'm hesitant to
post lengthy
Hello Everyone,
I'm Manu, one of the GSoC student under GNU Radio this year. I worked on
LDPC Codes, mentored by Jens. Another GSoC student Tracie also worked on
LDPC Codes this summer. We both worked such that there is minimum
duplicates and both our work complemented each other.
As the final ou
10 matches
Mail list logo
