اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSCMA Codebook Design Based on Uniquely Decomposable Constellation Groups
115
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Sparse code multiple access (SCMA), which helps improve spectrum efficiency (SE) and enhance connectivity, has been proposed as a non-orthogonal multiple access (NOMA) scheme for 5G systems. In SCMA, codebook design determines system overload ratio and detection performance at a receiver. In this paper, an SCMA codebook design approach is proposed based on uniquely decomposable constellation group (UDCG). We show that there are $N+1 (N geq 1)$ constellations in the proposed UDCG, each of which has $M (M geq 2)$ constellation points. These constellations are allocated to users sharing the same resource. Combining the constellations allocated on multiple resources of each user, we can obtain UDCG-based codebook sets. Bit error ratio (BER) performance will be discussed in terms of coding gain maximization with superimposed constellations and UDCG-based codebooks. Simulation results demonstrate that the superimposed constellation of each resource has large minimum Euclidean distance (MED) and meets uniquely decodable constraint. Thus, BER performance of the proposed codebook design approach outperforms that of the existing codebook design schemes in both uncoded and coded SCMA systems, especially for large-size codebooks.
قيم البحث
اقرأ أيضاً
Sparse code multiple access (SCMA) is a promising multiuser communication technique for the enabling of future massive machine-type networks. Unlike existing codebook design schemes assuming uniform power allocation, we present a novel class of SCMA
codebooks which display power imbalance among different users for downlink transmission. Based on the Star-QAM mother constellation structure and with the aid of genetic algorithm, we optimize the minimum Euclidean distance (MED) and the minimum product distance (MPD) of the proposed codebooks. Numerical simulation results show that our proposed codebooks lead to significantly improved error rate performances over Gaussian channels and Rayleigh fading channels.
With the explosively increasing demands on the network capacity, throughput and number of connected wireless devices, massive connectivity is an urgent problem for the next generation wireless communications. In this paper, we propose a grant-free ac
cess protocol for massive connectivity that utilizes a large number of antennas in a base station (BS) and is expected to be widely deployed in cellular networks. The scheme consists of a sparse structure in sparse code multiple access (SCMA) and receiver processing based on dictionary learning (DL). A large number of devices can transmit data without any scheduling process. Unlike existing schemes, whose signal schedulings require a lot of overhead, the scheduling overhead required by the proposed scheme is negligible, which is attractive for resource utilization and transmission power efficiency. The numerical results show that the proposed scheme has promising performance in massive connectivity scenario of cellular networks.
Beamforming technology is widely used in millimeter wave systems to combat path losses, and beamformers are usually selected from a predefined codebook. Unfortunately, the traditional codebook design neglects the beam squint effect, and this will cau
se severe performance degradation when the bandwidth is large. In this letter, we consider that a codebook with fixed size is adopted in the wideband beamforming system. First, we analyze how beam squint affects system performance when all beams have the same width. The expression of average spectrum efficiency is derived based on the ideal beam pattern. Next, we formulate the optimization problem to design the optimal codebook. Simulation results demonstrate that the proposed codebook deals with beam squint by spreading the beam coverage and significantly mitigates the performance degradation.
In this paper, we investigate the symbol-level precoding (SLP) design problem in the downlink of a multiuser multiple-input single-output (MISO) channel. We consider generic constellations with any arbitrary shape and size, and confine ourselves to o
ne of the main categories of constructive interference regions (CIR), namely, distance preserving CIR (DPCIR). We provide a comprehensive study of DPCIRs and derive some properties for these regions. Using these properties, we first show that any signal in a given DPCIR has a norm greater than or equal to the norm of the corresponding constellation point if and only if the convex hull of the constellation contains the origin. It is followed by proving that the power of the noiseless received signal lying on a DPCIR is a monotonic strictly increasing function of two parameters relating to the infinite Voronoi edges. Using the convex description of DPCIRs and their properties, we formulate two design problems, namely, the SLP power minimization with signal-to-interference-plus-noise ratio (SINR) constraints, and the SLP SINR balancing problem under max-min fairness criterion. The SLP power minimization based on DPCIRs can straightforwardly be written as a quadratic program (QP). We provide a simplified reformulation of this problem which is less computationally complex. The SLP max-min SINR, however, is non-convex in its original form, and hence difficult to tackle. We propose several alternative optimization approaches, including semidefinite program (SDP) formulation and block coordinate descent (BCD) optimization. We discuss and evaluate the loss due to the proposed alternative methods through extensive simulation results.
In this paper, a practical coding scheme is designed for the binary Wyner-Ziv (WZ) problem by using nested low-density generator-matrix (LDGM) and low-density parity-check (LDPC) codes. This scheme contains two steps in the encoding procedure. The fi
rst step involves applying the binary quantization by employing LDGM codes and the second one is using the syndrome-coding technique by utilizing LDPC codes. The decoding algorithm of the proposed scheme is based on the Sum-Product (SP) algorithm with the help of a side information available at the decoder side. It is theoretically shown that the compound structure has the capability of achieving the WZ bound. The proposed method approaches this bound by utilizing the iterative message-passing algorithms in both encoding and decoding, although theoretical results show that it is asymptotically achievable.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
