148IEEEJOURNALONSELECTEDAREASINCOMMUNICATIONS,VOL.32,NO.1,JANUARY

2014
Fig.4.EffectivenessoftheencodingalgorithmonsyntheticFIBtableswithdare=selected2columnsaccordingandWto=the8,ZipfasadistributionfunctionofthewithZipftheparameter.givenparameter.ElementsByTheorem3,theoptimalencodingwidthisatleastW+2=10andatmost2W=16.Sinced=2,oursuggestedconvexschemetakesatmostd xed-length 1=1encodingbitmorehasthanathe xedtheoreticalwidthof2lowerW=bound.16bits,Inwhilecomparison,theHuffmantheencodingsometimesachievesagreater

width.
(a)Effectivenessoftheencodingalgorithmasafunctionofthenumberofcolumnswith2W=32distinctelementsper

column.
(b)Effectivenessoftheencodingalgorithmasafunctionofthenumberofdistinctelementspercolumnwithd=10columns.
Fig.5.Analysisoftheencodingalgorithmasafunctionoftableparameters.
cankeepanadditionalcopyofthetablethatwillbeaccessedinsuchcases.
VII.EXPERIMENTALRESULTS
Wenowturntoconductingexperimentstoexaminethedis-tributionoftheoptimalencodingwidthandtheperformanceofoursuggestedencodingalgorithmfromSectionIII-B.Intheexperiments,werelyonbothsyntheticandreal-lifeFIBtables.
A.EffectivenessonSyntheticFIBtables
We rstevaluateoursuggestedschemeonsynthetictwo-columnFIBtables.Inour rstexperiments,eachtablehas1000entrieswith2W=256(forW=8)distinctelements

in
Fig.6.EffectivenessofthenumberofentriesontheencodingwidthinsyntheticFIBtableswithd=4columnsandatmost2WWs==2,8=256(for3)distinctareconsidered.
elementsineachcolumn.TwovaluesoftheZipfparametereachofthed=2columns.Togeneratethetable,we rstmakesurethateachelementappearsatleastonceineachcolumnbyaddinganentrycontainingitwithanadditionalrandomelementintheothercolumn.ThisadditionalrandomelementisselectedaccordingtoaZipfdistributionofparameters.Then,weaddadditionalentrieswithd=2randomelementsselectedaccordingtothesamedistribution.Intuitively,aZipfdistributionwithalowerparametersisclosertotheuniformdistribution.
First,inFig.4,wecompareoursuggestedscheme(fromSectionIII-B),denoted“convex”,withthe xed-lengthandHuffmanencodingschemes.Theresultsarebasedontheaverageof10simulations.Wepresentthelowerboundgivenbythefractionalsolutionoftherelaxedoptimizationproblem(SectionIII-B).Wealsoshowoursuggestedscheme,whichtakestheceilingofthefractionalsolutionoftherelaxedproblem,unlessitexceeds2W,inwhichcaseitsimplyuses xed-lengthencoding.AssuggestedbyTheorem1,ourschemeisalwayswithind 1=1bitofthefractional-optimumlowerbound.Forinstance,foraZipfparameters=4,thewidthsfortheHuffman, xed-length,andoursuggestedencodingsarerespectively17.6,2W=16,and12.1,whilethelowerboundis11.2.Moregenerally,thelowertheZipfparameter,thecloserthelowerboundisto2W.Next,inFig.5,weplottheencodingef ciencyasafunctionofthenumberofcolumns(a)andofthenumberofelementsappearingineachcolumn(b).Inbothplotswetakeh=1000entriesandaZipfparameters=2.InFig.5(a)thenumberofelementsis32,i.e.W=5,andinFig.5(b)thenumberofcolumnsisd=10.Wecanseethatin(a),Huffmanbecomesbetterfortheworst-caseentrywidth.Intuitively,itisbecausetheratioofthestandarddeviationofthesumoftheencodings
ofdcolumnstotheexpectedsumdecreaseswithdas√1.Wewanttostressthatthepresentedencodingschemed
suggestsatradeoffbetweenmemoryrequirementsandrunningtime.Whileourschemeperformsbetterandobtainsanim-provedencodingwidth,itisalsomuchslowertorunthanthesimplerschemes.Asmentionedintheimplementationsection,itisdesignedforof ineorbackgrounduse.Forinstance,inFig.5(a),anunoptimizedimplementationofourschemeonabasicInteli5corerespectivelytook0.82secondsand23.1secondsforthetwo-columnandten-columntables,whiletheHuffmannschemeranintherespectively-negligibletimesof7and11milliseconds.
Compressing Video for TaskStream Currently, TaskStream allows users to upload videos up to 100 megabytes in size. Therefore, in order to upload a video...
PPMexe: PPM for Compressing Software Milenko Drini?? and Darko Kirovski? c ? Computer Science Department, UCLA, Los Angeles, USA ? Microsoft Research, ...
Face Fixer Compressing Polygon MeshesFace Fixer Compressing Polygon Meshes隐藏>> UNC Technical Report TR-00-04 Face Fixer: Compressing Polygon Meshes with ...
Compressing Hexahedral Volume Meshes Martin Isenburg? University of North Carolina at Chapel Hill Pierre Alliez? INRIA Sophia-Antipolis Abstract Unstructured ...
Compressing Mixed-State Sources by Sending Classical Information_专业资料。We consider visible compression for discrete memoryless sources of mixed quantum ...
Managing Gigabytes Compressing and Indexing Documents and Images_专业资料。As today’s information explosion generates greater and greater volumes of raw data...
Compressing File Collections with a TSP-Based Approach Dimitre Trendafilov Nasir Memon Torsten Suel Department of Computer and Information Science Technical ...
Compressing cube-connected cycles and butterfly networks We consider the simulation of large cube-connected cycles (CCC) and large butterfly networks (BFN)...
The objectives for compressing DEMs are obtain...更多>>Abstract. Wavelet decomposition is a well-known technique to compress image data. Here, we have ...
Re-Store: A System for Compressing, Browsing, and Searching Large Documents (Extended Abstract of Invited Presentation) Alistair Moffat Raymond Wan ...
热门文档