A Pre-Coding Scheme for Minimizing the Average BER Applicable to Cooperative Multi-Cell System

2011 ◽  
Vol 58-60 ◽  
pp. 2237-2244
Author(s):  
Jia Wu ◽  
Xin Su ◽  
Hui Gao ◽  
Zhang Zhang
Keyword(s):  
Data Streams ◽  
Low Complexity ◽  
Cell System ◽  
Base Station ◽  
Imperfect Csi ◽  
Channel State ◽  
Coding Scheme ◽  
Coding Method ◽  
Average Ber ◽  
Value Decomposition

In this paper, we design a pre-coding method in cooperative multi-cell system, which is the singular value decomposition (SVD) processing followed by a power allocation scheme of minimizing the average BER of the system under a set of every base station (BS) transmit power constraints. This method further reduces the residual interference through power efficiently allocated among the data streams. Moreover, taking different channel state information (CSI) error variances among user equipments (UEs) into consideration, the proposed low-complexity pre-coding scheme is robust to imperfect CSI.

scholarly journals Resource Allocation for Intelligent Reflecting Surfaces Assisted Federated Learning System with Imperfect CSI

Algorithms ◽  
2021 ◽  
Vol 14 (12) ◽  
pp. 363
Author(s):  
Wei Huang ◽  
Zhiren Han ◽  
Li Zhao ◽  
Hongbo Xu ◽  
Zhongnian Li ◽  
...  
Keyword(s):  
Resource Allocation ◽  
Low Complexity ◽  
Base Station ◽  
Learning System ◽  
Estimation Methods ◽  
Imperfect Csi ◽  
Training Time ◽  
Perfect Channel State Information ◽  
Time Minimization ◽  
Reflecting Surfaces

Due to its ability to significantly improve the wireless communication efficiency, the intelligent reflective surface (IRS) has aroused widespread research interest. However, it is a challenge to obtain perfect channel state information (CSI) for IRS-related channels due to the lack of the ability to send, receive, and process signals at IRS. Since most of the existing channel estimation methods are developed to obtain cascaded base station (BS)-IRS-user devices (UDs) channel, this paper studies the problem of computation and communication resource allocation of the IRS-assisted federated learning (FL) system based on the imperfect CSI. Specifically, we take the statistical CSI error model into consideration and formulate the training time minimization problem subject to the rate outage probability constraints. In order to solve this issue, the semi-definite relaxation (SDR) and the constrained concave convex procedure (CCCP) are invoked to transform it into a convex problem. Subsequently, a low-complexity algorithm is proposed to minimize the delay of the FL system. Numerical results show that the proposed algorithm effectively reduces the training time of the FL system base on imperfect CSI.

scholarly journals A Flexible Coding Scheme Based on Block Krylov Subspace Approximation for Light Field Displays with Stacked Multiplicative Layers

Sensors ◽  
2021 ◽  
Vol 21 (13) ◽  
pp. 4574
Author(s):  
Joshitha Ravishankar ◽  
Mansi Sharma ◽  
Pradeep Gopalakrishnan
Keyword(s):  
Light Field ◽  
Krylov Subspace ◽  
Motion Parallax ◽  
Low Rank ◽  
Coding Scheme ◽  
Krylov Subspace Approximation ◽  
New Type ◽  
Value Decomposition ◽  
Subspace Approximation ◽  
Inter Frame

To create a realistic 3D perception on glasses-free displays, it is critical to support continuous motion parallax, greater depths of field, and wider fields of view. A new type of Layered or Tensor light field 3D display has attracted greater attention these days. Using only a few light-attenuating pixelized layers (e.g., LCD panels), it supports many views from different viewing directions that can be displayed simultaneously with a high resolution. This paper presents a novel flexible scheme for efficient layer-based representation and lossy compression of light fields on layered displays. The proposed scheme learns stacked multiplicative layers optimized using a convolutional neural network (CNN). The intrinsic redundancy in light field data is efficiently removed by analyzing the hidden low-rank structure of multiplicative layers on a Krylov subspace. Factorization derived from Block Krylov singular value decomposition (BK-SVD) exploits the spatial correlation in layer patterns for multiplicative layers with varying low ranks. Further, encoding with HEVC eliminates inter-frame and intra-frame redundancies in the low-rank approximated representation of layers and improves the compression efficiency. The scheme is flexible to realize multiple bitrates at the decoder by adjusting the ranks of BK-SVD representation and HEVC quantization. Thus, it would complement the generality and flexibility of a data-driven CNN-based method for coding with multiple bitrates within a single training framework for practical display applications. Extensive experiments demonstrate that the proposed coding scheme achieves substantial bitrate savings compared with pseudo-sequence-based light field compression approaches and state-of-the-art JPEG and HEVC coders.

Efficient Domain Search for Fractal Image Compression Using Feature Extraction Technique

2012 ◽  
Vol 488-489 ◽  
pp. 1587-1591
Author(s):  
Amol G. Baviskar ◽  
S. S. Pawale
Keyword(s):  
Feature Extraction ◽  
Image Compression ◽  
Low Complexity ◽  
Contractive Mapping ◽  
Fractal Image Compression ◽  
Compression Technique ◽  
Image Encoding ◽  
Fractal Image ◽  
Coding Method ◽  
The Given

Fractal image compression is a lossy compression technique developed in the early 1990s. It makes use of the local self-similarity property existing in an image and finds a contractive mapping affine transformation (fractal transform) T, such that the fixed point of T is close to the given image in a suitable metric. It has generated much interest due to its promise of high compression ratios with good decompression quality. Image encoding based on fractal block-coding method relies on assumption that image redundancy can be efficiently exploited through block-self transformability. It has shown promise in producing high fidelity, resolution independent images. The low complexity of decoding process also suggested use in real time applications. The high encoding time, in combination with patents on technology have unfortunately discouraged results. In this paper, we have proposed efficient domain search technique using feature extraction for the encoding of fractal image which reduces encoding-decoding time and proposed technique improves quality of compressed image.

scholarly journals Two-Step Root-MUSIC for Direction of Arrival Estimation without EVD/SVD Computation

2018 ◽  
Vol 2018 ◽  
pp. 1-8 ◽  
Author(s):  
Feng-Gang Yan ◽  
Shuai Liu ◽  
Jun Wang ◽  
Ming Jin
Keyword(s):  
Super Resolution ◽  
Direction Of Arrival ◽  
Doa Estimation ◽  
Low Complexity ◽  
Music Algorithm ◽  
Correlation Matrices ◽  
Noise Subspace ◽  
Using Data ◽  
Eigen Decomposition ◽  
Value Decomposition

Most popular techniques for super-resolution direction of arrival (DOA) estimation rely on an eigen-decomposition (EVD) or a singular value decomposition (SVD) computation to determine the signal/noise subspace, which is computationally expensive for real-time applications. A two-step root multiple signal classification (TS-root-MUSIC) algorithm is proposed to avoid the complex EVD/SVD computation using a uniform linear array (ULA) based on a mild assumption that the number of signals is less than half that of sensors. The ULA is divided into two subarrays, and three noise-free cross-correlation matrices are constructed using data collected by the two subarrays. A low-complexity linear operation is derived to obtain a rough noise subspace for a first-step DOA estimate. The performance is further enhanced in the second step by using the first-step result to renew the previous estimated noise subspace with a slightly increased complexity. The new technique can provide close root mean square error (RMSE) performance to root-MUSIC with reduced computational burden, which are verified by numerical simulations.

Low-Complexity Intra-Coding Scheme for HEVC

2016 ◽  
Vol 35 (12) ◽  
pp. 4331-4349 ◽  
Author(s):  
Xiwu Shang ◽  
Guozhong Wang ◽  
Tao Fan ◽  
Yan Li ◽  
Yifan Zuo
Keyword(s):  
Low Complexity ◽  
Intra Coding ◽  
Coding Scheme

scholarly journals Low-to-Zero-Overhead IRS Reconfiguration: Decoupling Illumination and Channel Estimation

2021 ◽  
Author(s):  
Vahid Jamali
Keyword(s):  
Phase Shift ◽  
Channel Estimation ◽  
Wireless Systems ◽  
Mobile User ◽  
Base Station ◽  
Channel State ◽  
Major Bottleneck ◽  
Reconfiguration Overhead ◽  
Reflecting Surfaces ◽  
Special Case

Most algorithms developed so far for the optimization of Intelligent Reflecting Surfaces (IRSs) require knowledge of full Channel State Information (CSI). However, the resulting acquisition overhead constitutes a major bottleneck for the realization of IRS-assisted wireless systems in practice. In contrast, in this paper, focusing on downlink transmissions from a Base Station (BS) to a Mobile User (MU) that is located in a blockage region, we propose to optimize the IRS for illumination of the area centered around the MU. Hence, the proposed design requires the estimation of the MU’s position and not the full CSI. For a given IRS phase-shift configuration, the end-to-end BS-IRS-MU channel can then be estimated using conventional channel estimation techniques. The IRS reconfiguration overhead for the proposed scheme depends on the MU mobility as well as how wide the coverage of the IRS illumination is. Therefore, we develop a general IRS phase-shift design, which is valid for both the near- and far-field regimes and features a parameter for tuning the size of the illumination area. Moreover, we study a special case where the IRS illuminates the entire blockage area, which implies that the IRS phase shifts do not change over time leading to zero overhead for IRS reconfiguration.

scholarly journals Data Detection in Single User Massive MIMO Using Re-Transmissions

2019 ◽  
Vol 6 (1) ◽  
pp. 15-26 ◽  
Author(s):  
K. Vasudevan ◽  
K. Madhu ◽  
Shivani Singh
Keyword(s):  
Massive Mimo ◽  
Turbo Code ◽  
Additive White Gaussian Noise ◽  
Multiple Input Multiple Output ◽  
Low Complexity ◽  
Base Station ◽  
Mimo Channel ◽  
Data Detection ◽  
Major Drawback ◽  
Single User

Background:Single user Massive Multiple Input Multiple Output (MIMO) can be used to increase the spectral efficiency since the data is transmitted simultaneously from a large number of antennas located at both the base station and mobile. It is feasible to have a large number of antennas in the mobile, in the millimeter wave frequencies. However, the major drawback of single user massive MIMO is the high complexity of data recovery at the receiver.Methods:In this work, we propose a low complexity method of data detection with the help of re-transmissions. A turbo code is used to improve the Bit-Error-Rate (BER).Results and Conclusion:Simulation results indicate a significant improvement in BER with just two re-transmissions as compared to the single transmission case. We also show that the minimum average SNR per bit required for error-free propagation over a massive MIMO channel with re-transmissions is identical to that of the Additive White Gaussian Noise (AWGN) channel, which is equal to -1.6 dB.

Performance Analysis of Low Complexity Multiuser Scheduling Algorithms in MIMO System

2013 ◽  
Vol 392 ◽  
pp. 867-871
Author(s):  
Ming Xia Lv ◽  
Yan Kun Lai ◽  
Dong Tang
Keyword(s):  
Mimo System ◽  
Scheduling Algorithm ◽  
Low Complexity ◽  
Base Station ◽  
User Scheduling ◽  
Sum Capacity ◽  
Multiuser Scheduling ◽  
The Common ◽  
The Cost ◽  
Selection Algorithms

The total throughput of the communication system can be maximized by allocating the common radio resource to the user or the user group having the best channel quality at a given time and the multiuser diversity gain can be obtained when multiple users share the same channel at one time. The object to select the users is to select the users with the maximum sum capacity. As for a scheduling algorithm, exhaustive algorithm can get the largest capability of the system by multi-user scheduling. However, this algorithm is quite complex hence the cost of operation to a base station has substantial increased. We compare the multiuser performance of two fast user selection algorithms with low complexity in MIMO-MRC systems with co-channel interferences. From the simulation results, these two algorithms not only decrease the computational complexity of the scheduling algorithm but also retain large capability of the MIMO system.

scholarly journals Wi-Fi Backscatter System with Tag Sensors Using Multi-Antennas for Increased Data Rate and Reliability

Sensors ◽  
2020 ◽  
Vol 20 (5) ◽  
pp. 1314
Author(s):  
Taeoh Kim ◽  
Hyobeen Park ◽  
Yunho Jung ◽  
Seongjoo Lee
Keyword(s):  
Computational Complexity ◽  
Euclidean Distance ◽  
Multiple Antennas ◽  
Power Level ◽  
Low Complexity ◽  
Data Rate ◽  
Threshold Method ◽  
Channel State ◽  
Distance Method ◽  
Ber Performance

In this paper, we propose tag sensor using multi-antennas in a Wi-Fi backscatter system, which results in an improved data rate or reliability of the signal transmitted from a tag sensor to a reader. The existing power level modulation method, which is proposed to improve data rate in a Wi-Fi backscatter system, has low reliability due to the reduced distance between symbols. To address this problem, we propose a Wi-Fi backscatter system that obtains channel diversity by applying multiple antennas. Two backscatter methods are described for improving the data rate or reliability in the proposed system. In addition, we propose three low complexity demodulation methods to address the high computational complexity problem caused by multiple antennas: (1) SET (subcarrier energy-based threshold) method, (2) TCST (tag’s channel state-based threshold) method, and (3) SED (similar Euclidean distance) method. In order to verify the performance of the proposed backscatter method and low complexity demodulation schemes, the 802.11 TGn (task group n) channel model was utilized in simulation. In this paper, the proposed tag sensor structure was compared with existing methods using only sub-channels with a large difference in received CSI (channel state information) values or adopting power-level modulation. The proposed scheme showed about 10 dB better bit error rate (BER) performance and throughput. Also, proposed low complexity demodulation schemes were similar in BER performance with a difference of up to 1 dB and the computational complexity was reduced by up to 60% compared to the existing Euclidean distance method.

Sign in / Sign up

Export Citation Format

Share Document