spectral null
Recently Published Documents


TOTAL DOCUMENTS

71
(FIVE YEARS 7)

H-INDEX

10
(FIVE YEARS 1)

2020 ◽  
pp. 1
Author(s):  
Joe Buhler ◽  
Shahar Golan ◽  
Rob Pratt ◽  
Stan Wagon

2020 ◽  
Vol 66 (11) ◽  
pp. 7022-7032
Author(s):  
Yajing Zhou ◽  
Yang Yang ◽  
Zhengchun Zhou ◽  
Kushal Anand ◽  
Su Hu ◽  
...  
Keyword(s):  

2020 ◽  
pp. 1-1
Author(s):  
Longsheng Li ◽  
Xiaoling Zhang ◽  
Deming Kong ◽  
Meihua Bi ◽  
Shi Jia ◽  
...  
Keyword(s):  

2019 ◽  
Vol 16 (2) ◽  
pp. 484-488
Author(s):  
K. Rajasekhar ◽  
Prabhakara B. Rao

In Orthogonal Frequency Division Multiplexing (OFDM) based systems, with the increasing demand for data rate and reliability in Wireless communications and devices, several issues become very important like bandwidth efficiency, quality of service and radio coverage. However, OFDM is very sensitive to nonlinear effects due to the high peak-to-average power ratio (PAPR) owned by the transmitted signals and does not show robustness to spectral null channels. This paper proposes a novel BPSK OFDM system based on Haar wavelet transformation. The PAPR reduced by 10 log10 2 ≈ 3 dB at most, compared with the conventional OFDM system and shows robustness to spectral null channels, improving BER performance 3 dB at most. Finally, theoretical and simulated results of the Cumulative Distribution Functions (CDFs) of both Conventional and Proposed OFDM are compared to show that the Proposed OFDM has better performance than the Conventional OFDM.


2019 ◽  
Vol 23 (1) ◽  
pp. 20-23 ◽  
Author(s):  
Kees A. Schouhamer Immink ◽  
Kui Cai
Keyword(s):  

2019 ◽  
Vol 10 (1) ◽  
pp. 53-70
Author(s):  
Khmaies Ouahada ◽  
Hendrik C. Ferreira

Abstract A New graph distance concept introduced for certain coding techniques helped in their design and analysis as in the case of distance-preserving mappings and spectral shaping codes. A graph theoretic construction, mapping binary sequences to permutation sequences and inspired from the k-cube graph has reached the upper bound on the sum of the distances for certain values of the length of the permutation sequence. The new introduced distance concept in the k-cube graph helped better understanding and analyzing for the first time the concept of distance-reducing mappings. A combination of distance and the index-permutation graph concepts helped uncover and verify certain properties of spectral null codes, which were previously difficult to analyze.


2016 ◽  
Vol 62 (6) ◽  
pp. 3084-3102 ◽  
Author(s):  
Luca G. Tallini ◽  
Danilo Pelusi ◽  
Raffaele Mascella ◽  
Laura Pezza ◽  
Samir Elmougy ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document