Cross-layer strategies for resource allocation in wireless networks are essential to guaranty an efficient utilization of the scarce resource. In this paper, we present an efficient radio resource allocation scheme based on PHY/MAC cross layer design and QoS-guaranteed scheduling for multi-user (MU), multi-service (MS), multi-input multi-output (MIMO) concept, orthogonal frequency division multiple access (OFDMA) systems. It is about a downlink multimedia transmission chain in which the available resources as power and bandwidth, are dynamically allocated according to the system parameters. Among these parameters, we can mention the physical link elements such as channel state information, spectral efficiency and error code corrector rate, and MAC link variables, which correspond to the users QoS requirements and the queue status. Primarily, we use a jointly method which parametrizes these system parameters, according to the total power, and the bit error rate constraints. Secondly, we propose a QoS-guaranteed scheduling that shares the sub-carriers to the users. These users request several type of traffic under throughput threshold constraints. The main objective in this work is to adjust the average throughput per service of each user, according to their needs and likewise to satisfy a great number of connexions. Subsequently, we consider a model of moderated compartmentalization between various classes of services by partitioning the total bandwidth into several parts. Each class of service will occupy a part of the bandwidth and will be transmitted over a maximum number of sub-carriers. The simulation results show that the proposed strategy provides a more interesting performance improvement (in terms of average data rate and user satisfaction) than other existing resource allocation schemes, such as nonadaptive resource allocation strategy. The performances are also analyzed and compared for the two multi-service multi-user MIMO–OFDMA systems; with sub-carriers partitioning and without sub-carriers partitioning.