摘要
针对分布式Alamouti空时码（DASTC）系统的信道容量求解问题，提出了一种求解DASTC系统的信道容量闭式解及其上界的方法．该方法根据DASTC系统利用多节点联合发送信息的特点，选择距离信源节点最近的空闲节点作为中继节点构建了DASTC系统的无线中继信道模型，采用网络信息论中的最大割最小流定理，将DASTC信道模型分为广播信道模型和多接入信道模型，
Focusing on the solution of the channel capacity for distributed Alamouti space-time code (DASTC) system, a novel method to derive the upper bound and the closed-form solution of the channel capacity for DASTC is proposed. Choosing the idle node closest to source node as relay node and utilizing the characteristic of DASTC that multiple nodes transmit information cooperatively, the wireless relay channel model is established for DASTC system. Using the max-flow min-cut theorem in network information theory, this method divides the channel model of DASTC into broadcast channel model and multiple access channel model. Sequentially, the upper bound of channel capacity and the achievable channel capacity of DASTC under fixed fading channels and random fading channels are derived. The channel capacity of DASTC based on different protocols can be effectively analyzed. The simulation results show that the channel capacity of DASTC based on decode-and-forward protocol and the channel capacity of DASTC based on amplify-and-forward protocol, which are obtained by the proposed method, are superior to Shannon channel capacity of the direct transmission, and are increased by 1 b/(s·Hz) and 0.4 b/(s·Hz) at high SNR, respectively.
出处
《西安交通大学学报》
EI
CAS
CSCD
北大核心
2007年第6期706-706,共1页
Journal of Xi'an Jiaotong University
基金
国家自然科学基金资助项目（60372055）
教育部高等学校博士学科点专项科研基金资助项目（20030698027）
关键词
信道容量
空时码
分布式
容量分析
网络信息论
TC系统
信道模型
求解问题
Boundary conditions
Codes (symbols)
Computer simulation
Fading channels
Information theory
Mathematical models
Network protocols
Space time adaptive processing
Wireless telecommunication systems
