Research Article
OBBP: An Efficient Burst Packing Algorithm for IEEE802.16e Systems
(1) UnusedCount = [ ]; | (2) for i = 1: length(B’) | (3) X = B′(i); | (4) F = [ ]; | (5) for j = 1: X/2 | (6) F(j) = mod; | (7) end | (8) all_OF = [find(F==0)X]; | (9) OF{i} = all_OF(find(all_OF≤ & all_OF ≤ )); | (10) OF{i} = OF{i}(numel(all_OF)-numel(OF{i})+1 : end); | (11) end | (12) ifisempty(find(numel(OF{i})==0))==0 | (13) // increment bursts which have out of range OF. | (14) B′(find(numel(OF{i})==0))= B′(find(numel(OF{i})==0)) + 1; | (15) // counting unused slots. | (16) UnusedCount(find(numel(OF{i})==0)) = UnusedCount(find(numel(OF{i})==0)) + 1; | (17) end |
|