Hello All,

             We have executed  profiling test  of two versions of algorithm for decoding  compressed bitmap of EPDAN.

From the results , we see that performance is better in Tree based decoding (Version2 as given below )

Version 1: Bitmap based decoding   as present in current master branch ( Function name osmo_t4_decode )

Version 2: Tree based decoding  ( Function name decompress_crbb , as proposed in patch “Decompress the CRBB bitmap using tree based approach” )

A sample bitmap taken from a real mobile log is used for  the test.

Host execution: Time taken to decode (micro seconds)

Version 1: (Bitmap  based decoding) : MIN -17  MAX -19   AVERAGE -17.9

Version 2 (tree based decoding): MIN -4   MAX -13  AVERAGE - 5.2

Target  execution: Time taken to decode (micro seconds)

Version 1: (Bitmap  based decoding) : MIN -277  MAX -583   AVERAGE - 353

Version 2 (tree based decoding): MIN -67   MAX -86  AVERAGE – 69.8

Regards

Prasad