Chaotic particle swarm optimization-based OFDM system resource allocation algorithm
A chaotic particle swarm and allocation algorithm technology, applied in the field of system resource allocation, can solve the problems of premature particle swarm algorithm and lack of population diversity
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Publication Date
- 2011-02-23
- Estimated Expiration
- Not applicable · inactive patent
Smart Images
Figure 1 Figure 2 Figure 3
Abstract
Description
technical field
[0001] The invention relates to an OFDM system resource allocation algorithm based on chaotic particle swarm optimization, and belongs to the technical field of system resource allocation. Background technique
[0002] Orthogonal frequency division multiplexing (OFDM, orthogonal frequency division multiplexing) is a key multi-carrier transmission technology in wireless communication systems. It has the advantages of anti-multipath interference, anti-burst noise and effectively overcome frequency selective fading. Asymmetrical Digital Subscriber Line (ADSL), Digital Sound Broadcasting (DAB) and digital broadcast television have been widely used in many fields.
[0003] The basic principle of OFDM is to divide the frequency band into several orthogonal sub-carriers, and the high-speed data stream is divided into a corresponding number of low-speed data streams for parallel transmission on each sub-carrier. The subcarriers of the traditional OFDM system adopt a...
Examples
Embodiment 1
[0079] The purpose of the multi-user OFDM adaptive allocation algorithm is to find the optimal power so that the system rate is maximized under a given power constraint. The system model is described as:
[0080] max Σ k , n ω k , n R k , n
[0081] constrained to
[0082] where K is the total number of users, N is the total number of subcarriers in the system, ω k,n is the weighting factor of user k in subchannel n, which is used as a fair parameter to ensure the balance between network throughput and fairness. P in the first constraint in the model total represents the total available bandwidth, and the second constraint represents the non-negativity of power.
[0083] R k is the channel capacity of user k, defined as:
[0084] ...