检索结果-内蒙古大学图书馆

Affine code for T-user noisy multiple-access adder channel

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2000年第3期E83A卷 541-550页

作者： Cheng, J Watanabe, Y Doshisha Univ Dept Knowledge Eng & Comp Sci Kyotanabe 6100321 Japan

Coding scheme for a noisy multiple-access adder channel is proposed. When st T-user delta-decodable affine code C is given a priori, a qT-user lambda delta-decodable affine code C* is produced by using a q x q matrix B satisfying BA = lambda Iq x q e.g., a Hadamard matrix or a conference matrix. In particular, the case of delta = 1 is considered for the practical purposes. A (2n - 1)-user uniquely decodable (6 = 1) affine code Cn with arbitrary code length n is recursively constructed. When Cn plays a role of C, a q(2n - I)-user X-decodable affine code C* is obtained. The code length and the number of users of C* are more flexible than those of the Wilson's code. The total rate of the X-decodable code in this paper tends to be higher than that of the X-decodable code by Wilson as the number of users increases.

关键词： multiple-access communication adder channel multi-user code affine code delta-decodable code

来源：评论

学校读者我要写书评

暂无评论

T-user uniquely decodable k-ary affine code for multiple-access adder channel

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2000年第10期E83A卷 1914-1920页

作者： Cheng, J Watanabe, Y Doshisha Univ Dept Knowledge Engn & Comp Sci Kyotanabe 6100321 Japan

multi-user uniquely decodable (UD) k-ary coding for the multiple-access adder channel is investigated. It is shown that a Tf+g+1-user UD k-ary affine code with code length f+g+1 can be obtained from two T-f-user and T-g-user UD k-ary affine codes. This leads to construct recursively a T-n-user UD k-ary affine code with arbitrary code length n. The total rate of the code tends to be higher than those of all the multi-user UD k-ary codes reported previously as the number of users increases.

关键词： multiple-access communication adder channel multi-user code affine code uniquely decodable code

来源：评论

学校读者我要写书评

暂无评论

Capacity-Achieving MIMO-NOMA: Iterative LMMSE Detection

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2019年第7期67卷 1758-1773页

作者： Liu, Lei Chi, Yuhao Yuen, Chau Guan, Yong Liang Li, Ying Xidian Univ State Key Lab Integrated Serv Networks Xian 710071 Shaanxi Peoples R China City Univ Hong Kong Dept Elect Engn Hong Kong Peoples R China Nanyang Technol Univ Sch Elect & Elect Engn Singapore 639798 Singapore Singapore Univ Technol & Design Singapore 487372 Singapore

This paper considers a low-complexity iterative linear minimum mean square error (LMMSE) multiuser detector for the multiple-input and multiple-output system with nonorthogonal multiple access (MIMO-NOMA), where multiple single-antenna users simultaneously communicate with a multiple-antenna base station (BS). While LMMSE being a linear detector has a low complexity, it has suboptimal performance in multiuser detection scenario due to the mismatch between LMMSE detection and multiuser decoding. Therefore, in this paper, we provide the matching conditions between the detector and decoders for MIMO-NOMA, which are then used to derive the achievable rate of the iterative detection. We prove that a matched iterative LMMSE detector can achieve the optimal capacity of symmetric MIMO-NOMA with any number of users, the optimal sum capacity of asymmetric MIMO-NOMA with any number of users, all the maximal extreme points in the capacity region of asymmetric MIMO-NOMA with any number of users, and all points in the capacity region of two-user and three-user asymmetric MIMO-NOMA systems. In addition, a kind of practical low-complexity error-correcting multiuser code, called irregular repeat-accumulate code, is designed to match the LMMSE detector. Numerical results shows that the bit error rate performance of the proposed iterative LMMSE detection outperforms the state-of-art methods and is within 0.8 dB from the associated capacity limit.

关键词： MIMO-NOMA iterative LMMSE capacity achieving low-complexity multi-user detection multi-user code

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：