Combining partial transmit sequences and selective mapping to reduce computational complexity of selective mapping techniques

Author(s):  
Hsin‐Ying Liang ◽  
Hung‐Chi Chu ◽  
Yu‐Huei Cheng
2007 ◽  
Vol 53 (3) ◽  
pp. 719-724 ◽  
Author(s):  
Tao Jiang ◽  
Weidong Xiang ◽  
P.C. Richardson ◽  
Jinhua Guo ◽  
Guangxi Zhu

2012 ◽  
Vol 2012 ◽  
pp. 1-13
Author(s):  
A. Ghassemi ◽  
T. A. Gulliver

A high peak-to-average power ratio (PAPR) is one of the major drawbacks to using orthogonal frequency division multiplexing (OFDM) modulation. The three most effective distortionless techniques for PAPR reduction are partial transmit sequence (PTS), selective mapping (SLM), and tone reservation (TR). However, the high computational complexity due to the inverse discrete Fourier transform (IDFT) is a problem with these approaches. Implementation of these techniques typically employ direct computation of the IDFT, which is not the most efficient solution. In this paper, we consider the development and performance analysis of these distortionless techniques in conjunction with low-complexity IFFT algorithms to reduce the PAPR of the OFDM signal. Recently, proposed IFFT-based techniques are shown to substantially reduce the computational complexity and improve PAPR performance.


2011 ◽  
Vol 3 (1) ◽  
pp. 80
Author(s):  
Alexander Feldman ◽  
Jonathan M Kalman ◽  
◽  

Focal atrial tachycardia (AT) is a relatively uncommon cause of supraventricular tachycardia, but when present is frequently difficult to treat medically. Atrial tachycardias tend to originate from anatomically determined atrial sites. The P-wave morphology on surface electrocardiogram (ECG) together with more sophisticated contemporary mapping techniques facilitates precise localisation and ablation of these ectopic foci. Catheter ablation of focal AT is associated with high long-term success and may be viewed as a primary treatment strategy in symptomatic patients.


Author(s):  
Nico Potyka

Bipolar abstract argumentation frameworks allow modeling decision problems by defining pro and contra arguments and their relationships. In some popular bipolar frameworks, there is an inherent tendency to favor either attack or support relationships. However, for some applications, it seems sensible to treat attack and support equally. Roughly speaking, turning an attack edge into a support edge, should just invert its meaning. We look at a recently introduced bipolar argumentation semantics and two novel alternatives and discuss their semantical and computational properties. Interestingly, the two novel semantics correspond to stable semantics if no support relations are present and maintain the computational complexity of stable semantics in general bipolar frameworks.


Sign in / Sign up

Export Citation Format

Share Document