• Journal of Communications and Networks
• /
• 제7권2호
• /
• pp.157-170
• /
• 2005

The combination of multiple antennas and multi-carrier code division multiple-access (MC-CDMA) is a strong candidate for the downlink of the next generation mobile communications. The study of such systems in scenarios that model real-life trans-missions is an additional step towards an optimized achievement. We consider a realistic MIMO channel with two or four transmit antennas and up to two receive antennas, and channel state information (CSI) mismatches. Depending on the mobile terminal (MT) class, its number of antennas or complexity allowed, different data-rates are proposed with turbo-coding and asymptotic spectral efficiencies from 1 to 4.5 bit/s/Hz, using three algorithms developed within the European IST-MATRICE project. These algorithms can be classified according to the degree of CSI at base-station (BS): i) Transmit space-frequency prefiltering based on constrained zero-forcing algorithm with complete CSI at BS; ii) transmit beamforming based on spatial correlation matrix estimation from partial CSI at BS; iii) orthogonal space-time block coding based on Alamouti scheme without CSI at BS. All presented schemes require a reasonable complexity at MT, and are compatible with a single-antenna receiver. A choice between these algorithms is proposed in order to significantly improve the performance of MC-CDMA and to cover the different environments considered for the next generation cellular systems. For beyond-3G, we propose prefiltering for indoor and pedestrian microcell environments, beamforming for suburban macrocells including high-speed train, and space-time coding for urban conditions with moderate to high speeds.

• ETRI Journal
• /
• 제25권2호
• /
• pp.144-147
• /
• 2003

We propose a new serial concatenation scheme for space-time and recursive convolutional codes, in which a space-time code is used as the outer code and a single recursive convolutional code as the inner code. We discuss previously proposed serial concatenation schemes employing multiple inner codes and compare them with the new one. The proposed method and the previous one with joint decoding, both performing a combined decoding of the simultaneous output signals from multiple antennas, give a large performance gain over the separate decoding method. In decoding complexity, the new concatenation scheme has a lower complexity compared with the multiple encoding/joint decoding scheme due to the use of the single inner code. Simulation results for a communication system with two transmit and one receive antennas in a quasi-static Rayleigh fading channel show that the proposed scheme outperforms the previous schemes.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2001년도 하계종합학술대회 논문집(1)
• /
• pp.9-12
• /
• 2001

In this paper, the natural space-time coding is applied for a DS-CDMA system with multiple transmit/receive antennas in a Rayleigh fading channel. With difference of arrival times from transmit antennas a modified maximum likelihood (ML) decoding algorithm is proposed for the space-time coded DS-CDMA system. The proposed decoding algorithm performs ML decoding over the transition of two consecutive branches by using a modified branch metric with the partial autocorrelation. By simulation, it is shown that the proposed decoding algorithm achieves significant performance improvement over the ML decoding algorithm without the modified branch metric.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권3호
• /
• pp.1425-1440
• /
• 2017

In wireless communications, antenna selection (AS) is a widely used method for reducing comparable cost of multiple RF chains in MIMO systems. As is well known, most of literatures on combining AS with MIMO techniques concern linear modulations such as phase shift keying (PSK) and quadrature amplitude modulation (QAM). The combination of CPM and MIMO has been considered an optimal choice that can improve its capacity without loss of power and spectrum efficiency. The aim of this paper is to investigate joint transmit and receive antenna selection (JTRAS) in CPM MIMO systems. Specifically, modified incremental and decremental JTRAS algorithms are proposed to adapt to arbitrary number of selected transmit or receive antennas. The computational complexity of several JTRAS algorithms is analyzed from the perspective of channel capacity. As a comparison, the performances of bit error rate (BER) and spectral efficiency are evaluated via simulations. Moreover, computational complexity of the JTRAS algorithms is simulated in the end. It is inferred from discussions that both incremental JTRAS and decremental JTRAS perform close to optimal JTRAS in BER and spectral efficiency. In the sense of practical scenarios, adaptive JTRAS can be employed to well tradeoff performance and computational complexity.

• 한국통신학회논문지
• /
• 제29권6A호
• /
• pp.607-613
• /
• 2004

차세대 무선 통신 시스템에서는 높은 주파수 효율을 얻기 위해 다중 송수신 안테나(Multiple Input Multiple Output (MIMO) 시스템을 갖는 공간 다중화(spatial multiplexing) 기술이 사용될 것이다. 다중 송수신 안테나 시스템은 비용과 복잡성을 줄이기 위해 송신 안테나 혹은 수신 안테나 중에서 이용 가능한 부 집합(sub-set)의 안테나만을 선택하는 것이 요구된다. 본 논문에서는 다중경로를 가지는 다중 송수신 안테나 시스템에 적합한 송신 안테나 선택 기법을 제안한다. 제안된 송신 안테나 선택 기법을 사용한 MIMO 시스템은 안테나 선택 기법을 사용하지 않은 시스템과 기존 제안된 송신 안테나 선택 기법을 사용한 시스템보다 더 나은 비트 오류율(BER) 성능을 얻을 수 있다.

• Journal of information and communication convergence engineering
• /
• 제2권2호
• /
• pp.67-70
• /
• 2004

In this paper, we propose two novel high-rate high-performance space-time codes for multiple-input multiple-output (MIMO) systems. When $n_T$ transmit antennas and When $n_R$ ＝ When $n_T$ receive antennas are deployed, the two proposed codes respectively offer transmission rates of (When $n_T$ -1) and (When $n_T$ -2) symbols per channel use and diversity orders of 3 and 5. As a consequence, our proposed codes allow the MIMO systems to employ a simple detection technique based on QR decomposition. Moreover, for equal or even higher spectral efficiencies, our proposed codes always provide much better bit error rate (BER) performances than V-BLAST architecture does when When $n_R$ ＝ When $n_T$. Computer simulation is given to verify performances of our proposed codes.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2004년도 SMICS 2004 International Symposium on Maritime and Communication Sciences
• /
• pp.32-35
• /
• 2004

In this paper, we propose two novel high-rate high-performance space-time codes for multiple-input multiple-output (MIMO) systems. When $n_{T}$ transmit antennas and $n_{R}$ = $n_{T}$ receive antennas are deployed, the two proposed codes respectively offer transmission rates of ( $n_{T}$ -I) and ( $n_{T}$ - 2) symbols per channel use and diversity orders of 3 and 5. As a consequence, our proposed codes allow the MIMO systems to employ a simple detection technique based on QR decomposition. Moreover, for equal or even higher spectral efficiencies, our proposed codes always provide much better bit error rate (BER) performances than V-BLAST architecture does when $n_{R}$ = $n_{T}$. Computer simulation is given to verify performances of our proposed codes.sed codes.des.

• 한국통신학회논문지
• /
• 제37B권10호
• /
• pp.947-955
• /
• 2012

본 논문에서는 셀룰러 네트워크상의 간섭정렬을 위한 송수신벡터를 구하는 반복 알고리즘들을 제안한다. 기존의 간섭채널상의 간섭정렬을 위해 고안된 반복 알고리즘을 셀룰러 네트워크에 적용하는 것이 물론 가능하지만, 높은 합용량을 달성하려면 큰 반복횟수가 필요하다. 본 논문에서 제안된 알고리즘의 핵심은 상향링크의 송신벡터 그리고 하향링크의 수신벡터를 갱신할 때 셀내간섭을 고려하지 않는다는 점이다. 모의실험은 간섭정렬을 위해 다중안테나와 단일 반송파가 사용되었을 때, 제안된 알고리즘이 기존의 알고리즘보다 주어진 반복횟수에서 월등히 높은 합용량을 달성함을 보인다. 또한 제안된 알고리즘이 간섭정렬을 위해 단일 안테나와 다중 부반송파가 사용되었을 때도 기존 간섭정렬 알고리즘보다 성능이 우수함을 보인다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권3호
• /
• pp.1016-1033
• /
• 2016

In this paper, we present a joint relay-and-antenna selection and power allocation strategy for multiple-input multi-output (MIMO) amplify-and-forward (AF) two-way relay networks (TWRNs). In our approach, we select the best transmit and receive antennas at the two sources, a best relay and a best transmit and receive antenna at the selected relay based on maximizing the minimum of the end-to-end received signal-to-noise-ratios (SNRs) under a total transmit power constraints. We obtained the closed-form solution for the optimal power allocation firstly. Then with the optimal allocation solution we found, we can reduce the joint relay-and-antenna selection to a simpler problem. Besides, the overall outage probability is investigated and a tight closed-form approximation is derived, which provides a method to evaluate the outage performance easily and fast. Simulation results are presented to verify the analysis.

• 한국정보통신학회논문지
• /
• 제21권3호
• /
• pp.523-529
• /
• 2017

본 논문은 송신에 이용되는 활성 송신 안테나와 송신 심볼을 이용해 정보를 전송하는 일반화 공간 변조 시스템에서 송신/수신 순서화를 결합하여 기존의 구복호 수신기보다 낮은 계산 복잡도를 갖는 수신 방식을 제안한다. 제안 수신기는 수신 순서화를 통해 수신 신호 연산을 최적의 순서로 수행하여 구 밖의 후보해에 대한 연산을 조기에 종료함으로써 계산량을 줄인다. 또한, 송신 순서화 방식을 적용하여 심볼과 활성 송신 안테나 탐색에서 해일 확률이 높은 후보 해부터 탐색을 수행하여 계산량을 낮추도록 한다. 모의실험을 통해 송신/수신 순서화를 적용한 제안 구복호 수신기가 기존 구복호 기법, 수신 순서화만 적용한 구복호 기법과 비교하여 동일한 비트오류율 성능을 유지하면서 더 낮은 계산 복잡도를 가짐을 확인하였다.