A Dimension Distance-Based SCMA Codebook Design
نویسندگان
چکیده
منابع مشابه
Variable dimension VQ encoding and codebook design
A variable dimension vector quantizer (VDVQ) has codewords of unequal dimensions. Here, a trellis-based sequential optimal VDVQ encoding algorithm is proposed. Also, a VDVQ codebook design algorithm based on splitting a node with equal or reduced dimensions is proposed that does not require any codebook parameter to be prespecified unlike known schemes. The VDVQ system is shown to outperform a ...
متن کاملSCMA with Low Complexity Symmetric Codebook Design for Visible Light Communication
Abstract—Sparse code multiple access (SCMA) is attracting significant research interests currently, which is considered as a promising multiple access technique for 5G systems. It serves as a good candidate for the future communication network with massive nodes due to its capability of handling user overloading. Introducing SCMA to visible light communication (VLC) can provide another opportun...
متن کاملCodebook Design of Keyblock Based Image Retrieval
This paper presents an image retrieval method based on keyblocks combing with interest points, furthermore the generation of codebook is also utilized to enhance the retrieval performance, where the balance between the retrieved precision and time cost can decide the codebook size of this CBIR system. Finally, the proposed method is compared with the method that only depends on interest points ...
متن کاملA Fast Evolutionary Algorithm in Codebook Design
This paper presents a fast algorithm to find an optimal subset codebook from a super codebook in a way that the RMS error between the new codebook and the training set in vector quantization becomes minimum. To have a fast algorithm, a genetic based algorithm is used that uses 2 evolutions, one in designing the whole sub-codebook and the other in finding each individual codeword of the sub-code...
متن کاملA Fast Partial Distance Search Algorithm for VQ Codebook
Vector quantization (VQ) is an efficient technique for image compression. However, one of the most serious problems of VQ is the heavily computational load for searching the closest codeword to the input vector in the codebook. To overcome this problem, we propose a simple and fast partial distance search algorithm for VQ codebook by using the sum-norm pyramid structure of codewords. The propos...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2017
ISSN: 2169-3536
DOI: 10.1109/access.2017.2685618