arXiv subjects

Keigo Takeuchi

Publications and source records attributed to Keigo Takeuchi.

32 records · Page 2Linked to original sources

arXiv2014

Performance Improvement of Iterative Multiuser Detection for Large Sparsely-Spread CDMA Systems by Spatial Coupling

Kudekar et al. proved that the belief-propagation (BP) performance for low-density parity check (LDPC) codes can be boosted up to the maximum-a-posteriori (MAP) performance by spatial coupling. In this paper, spatial coupling is applied to sparsely-spread code-division multiple-access (CDMA) systems to improve the performance of iterative multiuser detection based on BP. Two iterative receivers based on BP are considered: One receiver is based on exact BP and the other on an approximate BP with Gaussian approximation. The performance of the two BP receivers is evaluated via density evolution (DE) in the dense limit after taking the large-system limit, in which the number of users and the spreading factor tend to infinity while their ratio is kept constant. The two BP receivers are shown to achieve the same performance as each other in these limits. Furthermore, taking a continuum limit for the obtained DE equations implies that the performance of the two BP receivers can be improved up to the performance achieved by the symbol-wise MAP detection, called individually-optimal detection, via spatial coupling. Numerical simulations show that spatial coupling can provide a significant improvement in bit error rate for finite-sized systems especially in the region of high system loads.

cs.IT↗

arXiv2013

Iterative Multiuser Detection and Decoding with Spatially Coupled Interleaving

Spatially coupled (SC) interleaving is proposed to improve the performance of iterative multiuser detection and decoding (MUDD) for quasi-static fading multiple-input multiple-output systems. The linear minimum mean-squared error (LMMSE) demodulator is used to reduce the complexity and to avoid error propagation. Furthermore, sliding window MUDD is proposed to circumvent an increase of the decoding latency due to SC interleaving. Theoretical and numerical analyses show that SC interleaving can improve the performance of the iterative LMMSE MUDD for regular low-density parity-check codes.

cs.IT↗

arXiv2013

A Potential Theory of General Spatially-Coupled Systems via a Continuum Approximation

This paper analyzes general spatially-coupled (SC) systems with multi-dimensional coupling. A continuum approximation is used to derive potential functions that characterize the performance of the SC systems. For any dimension of coupling, it is shown that, if the boundary of the SC systems is fixed to the unique stable solution that minimizes the potential over all stationary solutions, the systems can approach the optimal performance as the number of coupled systems tends to infinity.

cs.IT↗

arXiv2013

On an Achievable Rate of Large Rayleigh Block-Fading MIMO Channels with No CSI

Training-based transmission over Rayleigh block-fading multiple-input multiple-output (MIMO) channels is investigated. As a training method a combination of a pilot-assisted scheme and a biased signaling scheme is considered. The achievable rates of successive decoding (SD) receivers based on the linear minimum mean-squared error (LMMSE) channel estimation are analyzed in the large-system limit, by using the replica method under the assumption of replica symmetry. It is shown that negligible pilot information is best in terms of the achievable rates of the SD receivers in the large-system limit. The obtained analytical formulas of the achievable rates can improve the existing lower bound on the capacity of the MIMO channel with no channel state information (CSI), derived by Hassibi and Hochwald, for all signal-to-noise ratios (SNRs). The comparison between the obtained bound and a high SNR approximation of the channel capacity, derived by Zheng and Tse, implies that the high SNR approximation is unreliable unless quite high SNR is considered. Energy efficiency in the low SNR regime is also investigated in terms of the power per information bit required for reliable communication. The required minimum power is shown to be achieved at a positive rate for the SD receiver with no CSI, whereas it is achieved in the zero-rate limit for the case of perfect CSI available at the receiver. Moreover, numerical simulations imply that the presented large-system analysis can provide a good approximation for not so large systems. The results in this paper imply that SD schemes can provide a significant performance gain in the low-to-moderate SNR regimes, compared to conventional receivers based on one-shot channel estimation.

cs.IT↗

arXiv2013

Multi-Dimensional Spatially-Coupled Codes

Spatially-coupled (SC) codes are constructed by coupling many regular low-density parity-check codes in a chain. The decoding chain of SC codes stops when facing burst erasures. This problem can not be overcome by increasing coupling number. In this paper, we introduce multi-dimensional (MD) SC codes. Numerical results show that 2D-SC codes are more robust to the burst erasures than 1D-SC codes. Furthermore, we consider designing MD-SC codes with smaller rateloss.

cs.IT↗

arXiv2013

Accelerating Iterative Detection for Spatially Coupled Systems by Collaborative Training

This letter proposes a novel method for accelerating iterative detection for spatially coupled (SC) systems. An SC system is constructed by one-dimensional coupling of many subsystems, which are classified into training and propagation parts. An irregular structure is introduced into the subsystems in the training part so that information in that part can be detected successfully. The obtained reliable information may spread over the whole system via the subsystems in the propagation part. In order to allow the subsystems in the training part to collaborate, shortcuts between them are created to accelerate iterative detection for that part. As an example of SC systems, SC code-division multiple-access (CDMA) systems are considered. Density Evolution for the SC CDMA systems shows that the proposed method can provide a significant reduction in the number of iterations for highly loaded systems.

cs.IT↗

arXiv2012

A Greedy Algorithm of Data-Dependent User Selection for Fast Fading Gaussian Vector Broadcast Channels

User selection (US) with Zero-forcing beamforming is considered in fast fading Gaussian vector broadcast channels with perfect channel state information (CSI) at the transmitter. A novel criterion for US is proposed, which depends on both CSI and the data symbols, while conventional criteria only depend on CSI. Since the optimization of US based on the proposed criterion is infeasible, a greedy algorithm of data-dependent US is proposed to perform the optimization approximately. An overhead issue arises in fast fading channels: On every update of US, the transmitter might inform each user whether he/she has been selected, using a certain fraction of resources. This overhead results in a significant rate loss for fast fading channels. In order to circumvent this overhead issue, iterative detection and decoding schemes are proposed on the basis of belief propagation. The proposed iterative schemes require no information about whether each user has been selected. The proposed US scheme is compared to a data-independent US scheme. The complexity of the two schemes is comparable to each other for fast fading channels. Numerical simulations show that the proposed scheme can outperform the data-independent scheme for fast fading channels in terms of energy efficiency, bit error rate, and achievable sum rate.

cs.IT↗

arXiv2012

Large-System Analysis of Joint User Selection and Vector Precoding with Zero-Forcing Transmit Beamforming for MIMO Broadcast Channels

Multiple-input multiple-output (MIMO) broadcast channels (BCs) (MIMO-BCs) with perfect channel state information (CSI) at the transmitter are considered. As joint user selection (US) and vector precoding (VP) (US-VP) with zero-forcing transmit beamforming (ZF-BF), US and continuous VP (CVP) (US-CVP) and data-dependent US (DD-US) are investigated. The replica method, developed in statistical physics, is used to analyze the energy penalties for the two US-VP schemes in the large-system limit, where the number of users, the number of selected users, and the number of transmit antennas tend to infinity with their ratios kept constant. Four observations are obtained in the large-system limit: First, the assumptions of replica symmetry (RS) and 1-step replica symmetry breaking (1RSB) for DD-US can provide acceptable approximations for low and moderate system loads, respectively. Secondly, DD-US outperforms CVP with random US in terms of the energy penalty for low-to-moderate system loads. Thirdly, the asymptotic energy penalty of DD-US is indistinguishable from that of US-CVP for low system loads. Finally, a greedy algorithm of DD-US proposed in authors' previous work can achieve nearly optimal performance for low-to-moderate system loads.

cs.IT↗

arXiv2012

Large-System Analysis of Joint User Selection and Vector Precoding for Multiuser MIMO Downlink

Joint user selection (US) and vector precoding (US-VP) is proposed for multiuser multiple-input multiple-output (MU-MIMO) downlink. The main difference between joint US-VP and conventional US is that US depends on data symbols for joint US-VP, whereas conventional US is independent of data symbols. The replica method is used to analyze the performance of joint US-VP in the large-system limit, where the numbers of transmit antennas, users, and selected users tend to infinity while their ratios are kept constant. The analysis under the assumptions of replica symmetry (RS) and 1-step replica symmetry breaking (1RSB) implies that optimal data-independent US provides nothing but the same performance as random US in the large-system limit, whereas data-independent US is capacity-achieving as only the number of users tends to infinity. It is shown that joint US-VP can provide a substantial reduction of the energy penalty in the large-system limit. Consequently, joint US-VP outperforms separate US-VP in terms of the achievable sum rate, which consists of a combination of vector precoding (VP) and data-independent US. In particular, data-dependent US can be applied to general modulation, and implemented with a greedy algorithm.

cs.IT↗

arXiv2011

A Phenomenological Study on Threshold Improvement via Spatial Coupling

Kudekar et al. proved an interesting result in low-density parity-check (LDPC) convolutional codes: The belief-propagation (BP) threshold is boosted to the maximum-a-posteriori (MAP) threshold by spatial coupling. Furthermore, the authors showed that the BP threshold for code-division multiple-access (CDMA) systems is improved up to the optimal one via spatial coupling. In this letter, a phenomenological model for elucidating the essence of these phenomenon, called threshold improvement, is proposed. The main result implies that threshold improvement occurs for spatially-coupled general graphical models.

cs.IT↗

arXiv2011

Improvement of BP-Based CDMA Multiuser Detection by Spatial Coupling

Kudekar et al. proved that the belief-propagation (BP) threshold for low-density parity-check codes can be boosted up to the maximum-a-posteriori (MAP) threshold by spatial coupling. In this paper, spatial coupling is applied to randomly-spread code-division multiple-access (CDMA) systems in order to improve the performance of BP-based multiuser detection (MUD). Spatially-coupled CDMA systems can be regarded as multi-code CDMA systems with two transmission phases. The large-system analysis shows that spatial coupling can improve the BP performance, while there is a gap between the BP performance and the individually-optimal (IO) performance.

cs.IT↗

arXiv2011

Large-System Analysis of Joint Channel and Data Estimation for MIMO DS-CDMA Systems

This paper presents a large-system analysis of the performance of joint channel estimation, multiuser detection, and per-user decoding (CE-MUDD) for randomly-spread multiple-input multiple-output (MIMO) direct-sequence code-division multiple-access (DS-CDMA) systems. A suboptimal receiver based on successive decoding in conjunction with linear minimum mean-squared error (LMMSE) channel estimation is investigated. The replica method, developed in statistical mechanics, is used to evaluate the performance in the large-system limit, where the number of users and the spreading factor tend to infinity while their ratio and the number of transmit and receive antennas are kept constant. The performance of the joint CE-MUDD based on LMMSE channel estimation is compared to the spectral efficiencies of several receivers based on one-shot LMMSE channel estimation, in which the decoded data symbols are not utilized to refine the initial channel estimates. The results imply that the use of joint CE-MUDD significantly reduces rate loss due to transmission of pilot signals, especially for multiple-antenna systems. As a result, joint CE-MUDD can provide significant performance gains, compared to the receivers based on one-shot channel estimation.

cs.IT↗

arXiv2007

Asymptotic Analysis of General Multiuser Detectors in MIMO DS-CDMA Channels

We analyze a MIMO DS-CDMA channel with a general multiuser detector including a nonlinear multiuser detector, using the replica method. In the many-user, limit the MIMO DS-CDMA channel with the multiuser detector is decoupled into a bank of single-user SIMO Gaussian channels if a spatial spreading scheme is employed. On the other hand, it is decoupled into a bank of single-user MIMO Gaussian channels if a spatial spreading scheme is not employed. The spectral efficiency of the MIMO DS-CDMA channel with the spatial spreading scheme is comparable with that of the MIMO DS-CDMA channel using an optimal space-time block code without the spatial spreading scheme. In the case of the QPSK data modulation scheme the spectral efficiency of the MIMO DS-CDMA channel with the MMSE detector shows {\it waterfall} behavior and is very close to the corresponding sum capacity when the system load is just below the transition point of the {\it waterfall} behavior. Our result implies that the performance of a multiuser detector taking the data modulation scheme into consideration can be far superior to that of linear multiuser detectors.

cs.IT↗

arXiv2007

Hierarchical Decoupling Principle of a MIMO-CDMA Channel in Asymptotic Limits

We analyze an uplink of a fast flat fading MIMO-CDMA channel in the case where the data symbol vector for each user follows an arbitrary distribution. The spectral efficiency of the channel with CSI at the receiver is evaluated analytically with the replica method. The main result is that the hierarchical decoupling principle holds in the MIMO-CDMA channel, i.e., the MIMO-CDMA channel is decoupled into a bank of single-user MIMO channels in the many-user limit, and each single-user MIMO channel is further decoupled into a bank of scalar Gaussian channels in the many-antenna limit for a fading model with a limited number of scatterers.

cs.IT↗