627 research outputs found

    非直交多元接続のための高信頼空間変調

    Get PDF
     マルチユーザ空間変調(SM: Spatial Modulation)では,SM信号の疎性を用いた圧縮センシングによるマルチユーザ検出が研究されているものの,受信機においてチャネル情報が完全に既知であるという条件の下で議論されている.実際には受信機側でチャネル情報を推定し,推定したチャネル情報を用いて復調処理を行う.推定したチャネル情報の精度は復調の精度に影響を及ぼすため,チャネル推定は重要なものであり考慮しなければならない. そこで本研究ではチャネル推定を,ブロックスパース性を有する信号の再構成問題として扱い,ブロックスパース性を考慮した複素数近似メッセージ伝播法(BS-CAMP: Block-Sparse Complex Approximate Message Passing)によって信号の再構成を行う方法を提案する.BS-CAMPは受信機が送信信号に含まれる非零要素の個数を事前に知る必要がない再構成アルゴリズムとなっており,ランダムアクセス方式にも適用可能である.計算機シミュレーションより,BS-CAMPによるチャネル推定の精度やスループット特性への影響を示す. さらに,高信頼な通信を実現するにはチャネル推定だけでなく誤り訂正符号が重要となる.そこで併せて本研究ではSMに誤り訂正符号化を組み合わせたものの一つである,ターボトレリス符号化空間変調(SM-TTC: SM with Turbo Trellis-Coding)における符号の最適化及び性能解析を行った.具体的には,シンボルベースEXIT(Extrinsic Information Transfer)チャートを用いた低演算符号探索法によって,演算量を低減しながら最良の特性を示す符号を探索する.計算機シミュレーションより,探索した符号を用いたSM-TTCが従来のものよりも優れていること,および提案手法が従来の符号探索法よりも低計算量で符号探索が可能であることを示す.電気通信大学201

    Iterative decoding for MIMO channels via modified sphere decoding

    Get PDF
    In recent years, soft iterative decoding techniques have been shown to greatly improve the bit error rate performance of various communication systems. For multiantenna systems employing space-time codes, however, it is not clear what is the best way to obtain the soft information required of the iterative scheme with low complexity. In this paper, we propose a modification of the Fincke-Pohst (sphere decoding) algorithm to estimate the maximum a posteriori probability of the received symbol sequence. The new algorithm solves a nonlinear integer least squares problem and, over a wide range of rates and signal-to-noise ratios, has polynomial-time complexity. Performance of the algorithm, combined with convolutional, turbo, and low-density parity check codes, is demonstrated on several multiantenna channels. The results for systems that employ space-time modulation schemes seem to indicate that the best performing schemes are those that support the highest mutual information between the transmitted and received signals, rather than the best diversity gain

    Design and optimization of joint iterative detection and decoding receiver for uplink polar coded SCMA system

    Get PDF
    SCMA and polar coding are possible candidates for 5G systems. In this paper, we firstly propose the joint iterative detection and decoding (JIDD) receiver for the uplink polar coded sparse code multiple access (PC-SCMA) system. Then, the EXIT chart is used to investigate the performance of the JIDD receiver. Additionally, we optimize the system design and polar code construction based on the EXIT chart analysis. The proposed receiver integrates the factor graph of SCMA detector and polar soft-output decoder into a joint factor graph, which enables the exchange of messages between SCMA detector and polar decoder iteratively. Simulation results demonstrate that the JIDD receiver has better BER performance and lower complexity than the separate scheme. Specifically, when polar code length N=256 and code rate R=1/2 , JIDD outperforms the separate scheme 4.8 and 6 dB over AWGN channel and Rayleigh fading channel, respectively. It also shows that, under 150% system loading, the JIDD receiver only has 0.3 dB performance loss compared to the single user uplink PC-SCMA over AWGN channel and 0.6 dB performance loss over Rayleigh fading channel

    Fast Convergence and Reduced Complexity Receiver Design for LDS-OFDM System

    Get PDF
    Low density signature for OFDM (LDS-OFDM) is able to achieve satisfactory performance in overloaded conditions, but the existing LDS-OFDM has the drawback of slow convergence rate for multiuser detection (MUD) and high receiver complexity. To tackle these problems, we propose a serial schedule for the iterative MUD. By doing so, the convergence rate of MUD is accelerated and the detection iterations can be decreased. Furthermore, in order to exploit the similar sparse structure of LDS-OFDM and LDPC code, we utilize LDPC codes for LDS-OFDM system. Simulations show that compared with existing LDS-OFDM, the LDPC code improves the system performance

    Coded DS-CDMA Systems with Iterative Channel Estimation and no Pilot Symbols

    Full text link
    In this paper, we describe direct-sequence code-division multiple-access (DS-CDMA) systems with quadriphase-shift keying in which channel estimation, coherent demodulation, and decoding are iteratively performed without the use of any training or pilot symbols. An expectation-maximization channel-estimation algorithm for the fading amplitude, phase, and the interference power spectral density (PSD) due to the combined interference and thermal noise is proposed for DS-CDMA systems with irregular repeat-accumulate codes. After initial estimates of the fading amplitude, phase, and interference PSD are obtained from the received symbols, subsequent values of these parameters are iteratively updated by using the soft feedback from the channel decoder. The updated estimates are combined with the received symbols and iteratively passed to the decoder. The elimination of pilot symbols simplifies the system design and allows either an enhanced information throughput, an improved bit error rate, or greater spectral efficiency. The interference-PSD estimation enables DS-CDMA systems to significantly suppress interference.Comment: To appear, IEEE Transactions on Wireless Communication
    corecore