FBMC Transmitters with Reduced Complexity

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reduced Complexity Transceiver Processing for MIMO FBMC Systems

Filter bank multicarrier (FBMC) scheme is currently under investigation as a viable candidate for radio access replacing the current orthogonal frequency division multiplexing (OFDM). This is due to the possibility of higher spectral efficiency and less susceptibility to synchronization errors through flexible pulse shape design as opposed to traditional rectangular shape or sinc waveform, in t...

متن کامل

Low-complexity soft-output MIMO detection in FBMC/OQAM systems

This paper focuses on soft-output detection when coded spatial data multiplexing schemes are combined with filter bank multicarrier systems based on the offset quadrature amplitude modulation (FBMC/OQAM). Due to the modulationinduced interference, which is inherent to FBMC/OQAM, the soft-output detection is not trivial. The proposed technique circumvents this problem by removing the interferenc...

متن کامل

Truncated Turbo Decoding with Reduced Computational Complexity

The concept of concatenated codes and turbo decoding is well known and leads to a remarkable good performance in many applications. The resulting signal processing for this concept shows high complexity relative to conventional viterbi decoding. Therefore, this paper considers an alternative concept of turbo decoding to reduce the computational complexity. In this case, those sections of the se...

متن کامل

Reduced Complexity Symbol Detectors with Parallel Structures

The problem of practical realization of the optimal Axed-delay symbol-by-symbol detection algorithm is investigated. A simplified parallel symbol (SPS) detector is derived which is several times faster and simpler than that suggested by the original algorithm. A number of approximations are applied to the SPS detector which lead to the derivation of suboptimal detectors. An interesting suboptim...

متن کامل

Asynchronous Computational VSS with Reduced Communication Complexity

Verifiable secret sharing (VSS) is a vital primitive in secure distributed computing. It allows an untrusted dealer to verifiably share a secret among n parties in the presence of an adversary controlling at most t of them. VSS in the synchronous communication model has received tremendous attention in the cryptographic research community. Nevertheless, recent interest in deploying secure distr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Radioengineering

سال: 2018

ISSN: 1210-2512

DOI: 10.13164/re.2018.1147