[NUT-devel] Frame/Field problem

[Michael Niedermayer]

Hi

When we designed the pts->dts reorder algorithm we considered arbitrary
frame reorderings, but there was something we missed, that are mixes of
frame and field pictures, like:

    i1 p2 P3 p4 P5 p7 P8   (lower case is a field, upper is a frame)
PTS 2  3  4  6  7  9  10
DTS 0  1  2  4  5  7  8

As you can see no reordering of PTS can result in the DTS values.

The reason why this fails is (if my brain still works at 5:30am) that frame
pictures contain 2 fields and thus would have to be counted like 2
besides that they would really need 2 pts.

I suspect some solution based on dummy 0byte packets with the missing pts
after each frame might solve this, but i must think more about this ...

-- 
Michael     GnuPG fingerprint: 9FF2128B147EF6730BADF133611EC787040B0FAB

I do not agree with what you have to say, but I'll defend to the death your
right to say it. -- Voltaire
-------------- next part --------------
A non-text attachment was scrubbed...
Name: not available
Type: application/pgp-signature
Size: 189 bytes
Desc: Digital signature
URL: <http://lists.mplayerhq.hu/pipermail/nut-devel/attachments/20080220/cfdfb322/attachment.pgp>