<?xml version="1.0" encoding="UTF-8"?>
<!-- generator="FeedCreator 1.8" -->
<?xml-stylesheet href="https://wiki.mazoyer.eu/lib/exe/css.php?s=feed" type="text/css"?>
<rss version="2.0">
    <channel xmlns:g="http://base.google.com/ns/1.0">
        <title>AS201281 Wiki - studies:re56</title>
        <description>Your check engine light is on!</description>
        <link>https://wiki.mazoyer.eu/</link>
        <lastBuildDate>Wed, 13 May 2026 14:48:34 +0000</lastBuildDate>
        <generator>FeedCreator 1.8</generator>
        <image>
            <url>https://wiki.mazoyer.eu/lib/exe/fetch.php?media=wiki:logo.png</url>
            <title>AS201281 Wiki</title>
            <link>https://wiki.mazoyer.eu/</link>
        </image>
        <item>
            <title></title>
            <link>https://wiki.mazoyer.eu/doku.php?id=studies:re56:re56_implementation_example&amp;rev=1609792862&amp;do=diff</link>
            <description>The base station permanently but not continuously receives data (bits stored in a queue). Each bit (fifo) is stored in a buffer when this buffer has free space. This buffer may be either a simple array, in this case each bit has to be “tagged” as belonging to a given user, or several arrays each belonging to one user. Let&#039;s take one array per user. Those datas are then available to the</description>
            <author>anonymous@undisclosed.example.com (Anonymous)</author>
            <pubDate>Mon, 04 Jan 2021 20:41:02 +0000</pubDate>
        </item>
        <item>
            <title>Max-CQI scheduler</title>
            <link>https://wiki.mazoyer.eu/doku.php?id=studies:re56:re56_scheduler_max_cqi&amp;rev=1609792862&amp;do=diff</link>
            <description>Max-CQI scheduler


user = { CQI, RBG }
data = { UE_ID    }
rbg  = { RB[]     }

data[] buffer
data[] ue_data
rbg [] blocks
user[] users

user get_ue_max_cqi ()
  ue = users[0]

  for i in users do
    if ue.CQI &lt; i.CQI then
	  ue = i
    fi
  done
end

while is_there_free_ressources_block_group do
  ue = get_ue_max_cqi ()

  if buffer.has_data_for ( ue ) not null
    rbg = get_free_ressources_block_group ()
    ue.RBG.add ( rbg )
  fi
done

for ue in users do
  for b in nb_bits_per_sequence do
…</description>
            <author>anonymous@undisclosed.example.com (Anonymous)</author>
            <pubDate>Mon, 04 Jan 2021 20:41:02 +0000</pubDate>
        </item>
        <item>
            <title></title>
            <link>https://wiki.mazoyer.eu/doku.php?id=studies:re56:re56_scheduler_proportional_fair&amp;rev=1609792862&amp;do=diff</link>
            <description>Proportional fair

This scheduler algorithm is a mix between the 2 previous algorithms : round-robin &amp; max-CQI. It combines the equity principle of round-robin and the throughput optimization principle of max-CQI.

Proportional fair allocates resources to the UE which maximize the metric following :</description>
            <author>anonymous@undisclosed.example.com (Anonymous)</author>
            <pubDate>Mon, 04 Jan 2021 20:41:02 +0000</pubDate>
        </item>
        <item>
            <title></title>
            <link>https://wiki.mazoyer.eu/doku.php?id=studies:re56:re56_scheduler_round_robin&amp;rev=1609792862&amp;do=diff</link>
            <description>DATA { INT ind_user; }

RGB { RB rbs[] }

USER { RGB rgbs[]; DATA datas_to_transmit[]; }

# in the case of a lonely array as a buffer

DATA buffer[] # previously initialized 
# and continuously filled by the incoming datas

RGB all_rgbs[]

DATA u_data[nb_bits_per_sequence]

USER users[]

INT nb_bits_per_sequence

# scheduler size
FOR u IN users DO
	#FOR i in nb_bits_per_sequence DO
	#	u_data[i] = buffer.get_bit(u)
	#ENDFOR
	u_data[0] = buffer.get_bit(u)
	IF u_data.[0] IS NOT None
		u.rgbs += GET…</description>
            <author>anonymous@undisclosed.example.com (Anonymous)</author>
            <pubDate>Mon, 04 Jan 2021 20:41:02 +0000</pubDate>
        </item>
        <item>
            <title></title>
            <link>https://wiki.mazoyer.eu/doku.php?id=studies:re56:re56_specs&amp;rev=1609792862&amp;do=diff</link>
            <description>1. PURPOSE OF THE SYSTEM FUNCTION (10 lines)

The purpose of our system function is to simulate the sub-carriers allocation for packets transmission in the case of LTE communication. The system will focus on ressources allocation scheduling in the case of downlink communications. Several parts will be implemented:</description>
            <author>anonymous@undisclosed.example.com (Anonymous)</author>
            <pubDate>Mon, 04 Jan 2021 20:41:02 +0000</pubDate>
        </item>
    </channel>
</rss>
