scholarly journals Full-Duplex NOMA Transmission with Single-Antenna Buffer-Aided Relays

Electronics ◽  
2019 ◽  
Vol 8 (12) ◽  
pp. 1482 ◽  
Author(s):  
Nikolaos Nomikos ◽  
Panagiotis Trakadas ◽  
Antonios Hatziefremidis ◽  
Voliotis
Keyword(s):  
Low Complexity ◽  
Cooperative Relaying ◽  
Full Duplex ◽  
Practical Implementation ◽  
Network Nodes ◽  
Communication Techniques ◽  
Single Antenna ◽  
Low Complexity Implementation ◽  
Significant Performance ◽  
Multiple Network

The efficient deployment of fifth generation and beyond networks relies upon the seamless combination of recently introduced transmission techniques. Furthermore, as multiple network nodes exist in dense wireless topologies, low-complexity implementation should be promoted. In this work, several wireless communication techniques are considered for improving the sum-rate performance of cooperative relaying non-orthogonal multiple access (NOMA) networks. For this purpose, an opportunistic relay selection algorithm is developed, employing single-antenna relays to achieve full-duplex operation by adopting the successive relaying technique. In addition, as relays are equipped with buffers, flexible half-duplex transmission can be performed when packets reside in the buffers. The proposed buffer-aided and successive single-antenna (BASSA-NOMA) algorithm is presented in detail and its operation and practical implementation aspects are thoroughly analyzed. Comparisons with other relevant algorithms illustrate significant performance gains when BASSA-NOMA is employed without incurring high implementation complexity.

A Low-Complexity Full-Duplex Radio Implementation With a Single Antenna

2018 ◽  
Vol 67 (3) ◽  
pp. 2206-2218 ◽  
Author(s):  
Muhammad Sohaib Amjad ◽  
Haq Nawaz ◽  
Kerem Ozsoy ◽  
Ozgur Gurbuz ◽  
Ibrahim Tekin
Keyword(s):  
Low Complexity ◽  
Full Duplex ◽  
Single Antenna

Compact specification of polar codes

2019 ◽  
pp. 40-47
Author(s):  
R. A. Morozov ◽  
P. V. Trifonov
Keyword(s):  
Storage Capacity ◽  
Low Complexity ◽  
Practical Implementation ◽  
Polar Codes ◽  
Practical Relevance ◽  
Memory Consumption ◽  
Full Size ◽  
The Family ◽  
Erasure Probability ◽  
Binary Erasure Channel

Introduction:Practical implementation of a communication system which employs a family of polar codes requires either to store a number of large specifications or to construct the codes by request. The first approach assumes extensive memory consumption, which is inappropriate for many applications, such as those for mobile devices. The second approach can be numerically unstable and hard to implement in low-end hardware. One of the solutions is specifying a family of codes by a sequence of subchannels sorted by reliability. However, this solution makes it impossible to separately optimize each code from the family.Purpose:Developing a method for compact specifications of polar codes and subcodes.Results:A method is proposed for compact specification of polar codes. It can be considered a trade-off between real-time construction and storing full-size specifications in memory. We propose to store compact specifications of polar codes which contain frozen set differences between the original pre-optimized polar codes and the polar codes constructed for a binary erasure channel with some erasure probability. Full-size specification needed for decoding can be restored from a compact one by a low-complexity hardware-friendly procedure. The proposed method can work with either polar codes or polar subcodes, allowing you to reduce the memory consumption by 15–50 times.Practical relevance:The method allows you to use families of individually optimized polar codes in devices with limited storage capacity. 

NEURAL NETWORK METHOD OF ADAPTING THE PARAMETERS OF THE INFORMATION SYSTEMS INTERFACE

2020 ◽  
pp. 26-31
Author(s):  
А.Д. Обухов ◽  
М.Н. Краснянский ◽  
М.С. Николюкин
Keyword(s):  
Neural Networks ◽  
Information System ◽  
Information Systems ◽  
Statistical Processing ◽  
Low Complexity ◽  
User Preferences ◽  
Expert Assessment ◽  
Practical Implementation ◽  
Algorithmic Support ◽  
Interface Parameters

Рассматривается проблема выбора оптимальных параметров интерфейса в информационных системах с целью его персонализации под предпочтения пользователя и возможности его оборудования. В настоящее время для ее решения используется алгоритмическое обеспечение и статистическая обработка предпочтений пользователей, что не обеспечивает достаточной гибкости и точности. Поэтому в данной работе предлагается применение разработанного метода адаптации параметров интерфейса, основанного на анализе и обработке пользовательской информации с помощью нейронных сетей. Научная новизна метода заключается в автоматизации сбора, анализа данных и настройки интерфейса за счет использования и интеграции нейронных сетей в информационную систему. Рассмотрена практическая реализация предлагаемого метода на Python. Экспертная оценка адаптивности интерфейса тестовой информационной системы после внедрения разработанного метода показала его перспективность и эффективность. Разработанный метод показывает лучшую точность и низкую сложность программной реализации относительно классического алгоритмического подхода. Полученные результаты могут использоваться для автоматизации процесса выбора компонентов интерфейса различных информационных систем. Дальнейшие исследования заключаются в развитии и интеграции разработанного метода в рамках фреймворка адаптации информационных систем Here we consider the problem of choosing the optimal parameters of the interface in information systems with the aim of personalizing it for the preferences of the user and the capabilities of his equipment. Currently, algorithmic support and statistical processing of user preferences are used to solve it, which does not provide sufficient flexibility and accuracy. Therefore, in this work, we propose the application of the developed method for adapting interface parameters based on the analysis and processing of user information using neural networks. The scientific novelty of the method is to automate the collection, analysis of data and interface settings through the use and integration of neural networks in the information system. We consider the practical implementation of the proposed method in Python. An expert assessment of the adaptability of the interface of the test information system after the implementation of the developed method showed its availability and efficiency. The developed method shows the best accuracy and low complexity of software implementation relative to the classical algorithmic approach. The results obtained can be used to automate the selection of interface components for various information systems. Further research consists in the development and integration of the developed method within the framework of the information systems adaptation framework

Low-Complexity Coded Transmission Without CSI for Full-Duplex Relay Networks

2020 ◽  
Author(s):  
Chao Chen ◽  
Zheng Meng ◽  
Seung Jun Baek ◽  
Xiaohan Yu ◽  
Chuanhuang Li ◽  
...  
Keyword(s):  
Relay Networks ◽  
Low Complexity ◽  
Full Duplex ◽  
Full Duplex Relay

scholarly journals Low-complexity sparse-aware multiuser detection for large-scale MIMO systems

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Rong Ran ◽  
Hayoung Oh
Keyword(s):  
Large Scale ◽  
Mimo Systems ◽  
Minimum Mean Square Error ◽  
Multiple Input Multiple Output ◽  
Low Complexity ◽  
Finite Alphabet ◽  
Multiuser Detectors ◽  
Input Multiple Output ◽  
Error Detector ◽  
Significant Performance

AbstractSparse-aware (SA) detectors have attracted a lot attention due to its significant performance and low-complexity, in particular for large-scale multiple-input multiple-output (MIMO) systems. Similar to the conventional multiuser detectors, the nonlinear or compressive sensing based SA detectors provide the better performance but are not appropriate for the overdetermined multiuser MIMO systems in sense of power and time consumption. The linear SA detector provides a more elegant tradeoff between performance and complexity compared to the nonlinear ones. However, the major limitation of the linear SA detector is that, as the zero-forcing or minimum mean square error detector, it was derived by relaxing the finite-alphabet constraints, and therefore its performance is still sub-optimal. In this paper, we propose a novel SA detector, named single-dimensional search-based SA (SDSB-SA) detector, for overdetermined uplink MIMO systems. The proposed SDSB-SA detector adheres to the finite-alphabet constraints so that it outperforms the conventional linear SA detector, in particular, in high SNR regime. Meanwhile, the proposed detector follows a single-dimensional search manner, so it has a very low computational complexity which is feasible for light-ware Internet of Thing devices for ultra-reliable low-latency communication. Numerical results show that the the proposed SDSB-SA detector provides a relatively better tradeoff between the performance and complexity compared with several existing detectors.

A tuneable rat-race coupler for full duplex communications

2021 ◽  
pp. 1-7
Author(s):  
G. T. Watkins
Keyword(s):  
Interference Cancellation ◽  
Phase Shifter ◽  
Dipole Antenna ◽  
Full Duplex ◽  
Frequency Channel ◽  
Ism Band ◽  
Single Antenna ◽  
Variable Attenuator ◽  
Degree Of Isolation ◽  
Better Than

Abstract Full duplex (FD) could potentially double wireless communications capacity by allowing simultaneous transmission and reception on the same frequency channel. A single antenna architecture is proposed here based on a modified rat-race coupler to couple the transmit and receive paths to the antenna while providing a degree of isolation. To allow the self-interference cancellation (SiC) to be maximized, the rat-race coupler was made tuneable. This compensated for both the limited isolation of the rat race and self-interference caused by antenna mismatch. Tuneable operation was achieved by removing the fourth port of the rat race and inserting a variable attenuator and variable phase shifter into the loop. In simulation with a 50 Ω load on the antenna port, better than −65 dB narrowband SiC was achieved over the whole 2.45 GHz industrial, scientific and medical (ISM) band. Inserting the S-parameters of a commercially available sleeve dipole antenna into the simulation, better than −57 dB narrowband SiC could be tuned over the whole band. Practically, better than −58 dB narrowband tuneable SiC was achieved with a practical antenna. When excited with a 20 MHz Wi-Fi signal, −42 dB average SiC could be achieved with the antenna.

Error rate performance of NOMA system with full-duplex cooperative relaying

2021 ◽  
pp. 101447
Author(s):  
Meiling Li ◽  
Shuaibo Huang ◽  
Lili Tian ◽  
Omar Alhussein ◽  
Sami Muhaidat
Keyword(s):  
Error Rate ◽  
Cooperative Relaying ◽  
Full Duplex ◽  
Rate Performance
Sign in / Sign up

Export Citation Format

Share Document