Reduced Constraint Set Linear Program for Tone Reservation in Multicarrier Modulation

2009 ◽  
Vol E92-B (6) ◽  
pp. 2231-2234
Author(s):  
Abolfazl GHASSEMI ◽  
T. Aaron GULLIVER
Keyword(s):  
Multicarrier Modulation ◽  
Linear Program ◽  
Constraint Set ◽  
Tone Reservation

scholarly journals Enhancing PAPR reduction for FBMC-OQAM systems by joint both tone reservation and companding methods

2021 ◽  
Vol 21 (2) ◽  
pp. 919
Author(s):  
Salima Senhadji ◽  
Yassine Mohammed Bendimerad ◽  
Fathi Tarik Bendimerad
Keyword(s):  
Average Power ◽  
Multicarrier Modulation ◽  
Reduction Technique ◽  
Papr Reduction ◽  
Power Ratio ◽  
Reduction Techniques ◽  
Reduction Methods ◽  
Large Peak ◽  
Tone Reservation ◽  
Simulation Results

<span>One of the major problems that faces any wireless communication system that apply multicarrier modulation technology is large Peak-to-Average Power Ratio (PAPR). There are divers PAPR reduction methods to solve this problem. Tone Reservation (TR) scheme is one of the most famous PAPR reduction techniques in which a peak cancelling signal is added to the original one in such a way that PAPR will reduce. Companding is another easy PAPR reduction technique in which compression of large amplitude samples and expansion of low one. In this paper, we suggest a new PAPR reduction scheme based on combining tone reservation and companding techniques for FBMC-OQAM systems. The simulation results show that the new scheme (TR&amp;Compd) presents better result in term of PAPR reduction compared to TR and Companding methods taken separately.</span>

scholarly journals Discrete-Time Constrained Average Stochastic Games with Independent State Processes

Mathematics ◽  
2019 ◽  
Vol 7 (11) ◽  
pp. 1089
Author(s):  
Wenzhao Zhang
Keyword(s):  
Discrete Time ◽  
Stochastic Games ◽  
Transition Probability ◽  
Existence Condition ◽  
Linear Program ◽  
Global Minimizer ◽  
Independent State ◽  
Occupation Measures ◽  
Best Response ◽  
Mathematic Program

In this paper, we consider the discrete-time constrained average stochastic games with independent state processes. The state space of each player is denumerable and one-stage cost functions can be unbounded. In these game models, each player chooses an action each time which influences the transition probability of a Markov chain controlled only by this player. Moreover, each player needs to pay some costs which depend on the actions of all the players. First, we give an existence condition of stationary constrained Nash equilibria based on the technique of average occupation measures and the best response linear program. Then, combining the best response linear program and duality program, we present a non-convex mathematic program and prove that each stationary Nash equilibrium is a global minimizer of this mathematic program. Finally, a controlled wireless network is presented to illustrate our main results.

Sign in / Sign up

Export Citation Format

Share Document