• Title/Summary/Keyword: MIMO Channel

Search Result 680, Processing Time 0.02 seconds

Suboptimum detection of space-time trellis coded OFDM over slowly fading channel (느린 페이딩 채널에서 공간-시간 트렐리스 부호화된 OFDM의 준최적 검파)

  • Kim, Young-Ju;Li, Xun;Park, Noe-Yoon;Lee, In-Sung
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.12
    • /
    • pp.28-33
    • /
    • 2007
  • We present a space-time trellis coded OFDM system in flow fading channels. Generalized principal ratio combining (GPRC) is also analyzed theoretically in frequency domain. The analysis show that the decoding metric of GPRC include the metrics of maximum likelihood (ML) and PRC. The computer simulations with M-PSK modulation are obtained in frequency flat and frequency selective lading channels. The decoding complexity and simulation running times are also evaluated among the decoding schemes.

Margin Adaptive Optimization in Multi-User MISO-OFDM Systems under Rate Constraint

  • Wei, Chuanming;Qiu, Ling;Zhu, Jinkang
    • Journal of Communications and Networks
    • /
    • v.9 no.2
    • /
    • pp.112-117
    • /
    • 2007
  • In this paper, we focus on the total transmission power minimization problem for downlink beamforming multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems while ensuring each user's QoS requirement. Although the linear integer programming (LIP) solution we formulate provides the performance upper bound of the margin adaptive (MA) optimization problem, it is hard to be implemented in practice due to its high computational complexity. By regarding each user's equivalent channel gain as approximate independent values and using iterative descent method, we present a heuristic MA resource allocation algorithm. Simulation results show that the proposed algorithm efficiently converges to the local optimum, which is very close to the performance of the optimal LIP solution. Compared with existing space division multiple access (SDMA) OFDM systems with or without adaptive resource allocation, the proposed algorithm achieves significant performance improvement by exploiting the frequency diversity and multi-user diversity in downlink multiple-input single-output (MISO) OFDM systems.

Improvement of the Link Reliability for Ship Ad-Hoc Network by Employing Multiple Antennas

  • Su, Xin;Hui, Bing;Chang, KyungHi;Kim, SeungGeun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37A no.12
    • /
    • pp.1065-1075
    • /
    • 2012
  • For the purpose of providing high data rate real-time services, radio transmission technologies (RTT) for ship ad-hoc network (SANET) based on the Recommendation ITU-R 1842-1 are designed. Physical layer parameters of SANET are contrived to meet the requirements of the specification. In order to improve the link reliability for SANET, in this paper, we investigate the performance of the SANET with the multiple antennas, where receive combining (RC), transmit diversity (TD), and beamforming (BF) are employed, respectively. Based on the analysis of the packet error rate (PER) under the highly correlated maritime wireless channel model, we select the efficient multiple antenna schemes for SANET to improve the link reliability. In addition, the optimal MCS levels for the single-carrier (SC) SANET with the bandwidth of 25 kHz, and the multi-carrier (MC) SANET with the bandwidth of 50 kHz and 100 kHz are finalized.

Generalized Distributed Multiple Turbo Coded Cooperative Differential Spatial Modulation

  • Jiangli Zeng;Sanya Liu;Hui Wang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.3
    • /
    • pp.999-1021
    • /
    • 2023
  • Differential spatial modulation uses the antenna index to transmit information, which improves the spectral efficiency, and completely bypasses any channel side information in the recommended setting. A generalized distributed multiple turbo coded-cooperative differential spatial modulation based on distributed multiple turbo code is put forward and its performances in Rayleigh fading channels is analyzed. The generalized distributed multiple turbo coded-cooperative differential spatial modulation scheme is a coded-cooperation communication scheme, in which we proposed a new joint parallel iterative decoding method. Moreover, the code matched interleaver is considered to be the best choice for the generalized multiple turbo coded-cooperative differential spatial modulation schemes, which is the key factor of turbo code. Monte Carlo simulated results show that the proposed cooperative differential spatial modulation scheme is better than the corresponding non-cooperative scheme over Rayleigh fading channels in multiple input and output communication system under the same conditions. In addition, the simulation results show that the code matched interleaver scheme gets a better diversity gain as compared to the random interleaver.

Connection between Fourier of Signal Processing and Shannon of 5G SmartPhone (5G 스마트폰의 샤논과 신호처리의 푸리에의 표본화에서 만남)

  • Kim, Jeong-Su;Lee, Moon-Ho
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.6
    • /
    • pp.69-78
    • /
    • 2017
  • Shannon of the 5G smartphone and Fourier of the signal processing meet in the sampling theorem (2 times the highest frequency 1). In this paper, the initial Shannon Theorem finds the Shannon capacity at the point-to-point, but the 5G shows on the Relay channel that the technology has evolved into Multi Point MIMO. Fourier transforms are signal processing with fixed parameters. We analyzed the performance by proposing a 2N-1 multivariate Fourier-Jacket transform in the multimedia age. In this study, the authors tackle this signal processing complexity issue by proposing a Jacket-based fast method for reducing the precoding/decoding complexity in terms of time computation. Jacket transforms have shown to find applications in signal processing and coding theory. Jacket transforms are defined to be $n{\times}n$ matrices $A=(a_{jk})$ over a field F with the property $AA^{\dot{+}}=nl_n$, where $A^{\dot{+}}$ is the transpose matrix of the element-wise inverse of A, that is, $A^{\dot{+}}=(a^{-1}_{kj})$, which generalise Hadamard transforms and centre weighted Hadamard transforms. In particular, exploiting the Jacket transform properties, the authors propose a new eigenvalue decomposition (EVD) method with application in precoding and decoding of distributive multi-input multi-output channels in relay-based DF cooperative wireless networks in which the transmission is based on using single-symbol decodable space-time block codes. The authors show that the proposed Jacket-based method of EVD has significant reduction in its computational time as compared to the conventional-based EVD method. Performance in terms of computational time reduction is evaluated quantitatively through mathematical analysis and numerical results.

On the Performance of Zero-Forcing Beamforming with Semi-orthogonal User Selection in Clustered Cell Coordinated Transmission (제로 포싱 (zero-forcing) 빔 형성과 반직교 기반 사용자 선정을 이용한 클러스터 (cluster) 기반 셀 협력 전송 방식의 성능에 대한 연구)

  • Yang, Jang-Hoon;Jang, Seung-Hun;Kim, Dong-Ku
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.10
    • /
    • pp.1-9
    • /
    • 2008
  • In this paper, a simple and efficient three cell based clustered-cell coordination is proposed with well hewn zero-forcing beamforming (ZF-BF) with a semi-orthogonal user selection (SUS) as transmission and scheduling scheme. For a modified Wyner's channel model with two classes of user groups for a hexagonal cellular system, the upper bound of asymptotic sum rate scaling of ZF-BF in a proposed coordination is shown to be proportional to the number of transmit antennas and double logarithms of the number of users. The numerical results verify the efficiency of the proposed cell coordination. It is also numerically shown that ZF-BF with the SUS in CCCT actually achieves the upper bound of asymptotic sum rate sum rate scaling.

Tactical Beamforming for Anti-Jamming Under Limited Feedback (제한된 피드백 상황에서의 항재밍을 위한 전략적 빔형성)

  • Lim, Sung-Ho;Han, Sungmin;Lee, Jaeseok;Choi, Ji-Woong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.11
    • /
    • pp.1410-1413
    • /
    • 2016
  • Array beamforming for anti-jamming means that jamming signals are superposed destructively, while superposing information signals constructively at a receiver. However, according to channel state variation, the anti-jamming performance of the beamforming can be degraded because of large beamwidth of the sidelobe and lower selectivity of the mainlobe. To mitigate this problem, we introduce a beamformed decoy signal which uses frequency band distinguished from the information signal to make the jammer concentrate its jamming power to a wrong target under limited feedback. In this paper, we show that the performance of the proposed scheme can approach that of optimal one with perfect feedback.

Enhanced Wireless Network Security in Military Environments (군사 환경에서의 향상된 무선 네트워크 보안)

  • Kim, Jin Woo;Shin, Soo Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.11
    • /
    • pp.1341-1348
    • /
    • 2016
  • In this paper, we propose method to enhance security performance using HT-STBC with artificial noise under Wier-Tap channel model that exist with legitimate receiver and illegal eavesdropper. Conventional STBC with artificial noise scheme has a weakness that a limited increase in the BER of the difference between the receiver and an eavesdropper, when used over QPSK modulation. To solve this problem, we suggest HT-STBC combining hadamard transform and STBC with artificial noise for reduce BER of receiver than the conventional scheme and demonstrated through simulation that also increased BER difference between the receiver and an eavesdropper. By the simulation results, when used proposed scheme, showed approximately 3dB improvement in performance compared to the conventional scheme.

Design of Efficient FFT Processor for IEEE 802.16e Mobile WiMax Systems (IEEE 802.16e Mobile WiMax 시스템을 위한 효율적인 FFT 프로세서 설계)

  • Park, Youn-Ok;Park, Jong-Won
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.10 no.2
    • /
    • pp.97-102
    • /
    • 2010
  • In this paper, an area-efficient FFT processor is proposed for IEEE 802.16e mobile WiMax systems. The proposed scalable FFT processor can support the variable length of 128, 512, 1024 and 2048. By reducing the required number of non-trivial multipliers with mixed-radix (MR) and multi-path delay commutator (MDC) architecture, the complexity of the proposed FFT processor is dramatically decreased without sacrificing system throughput. The proposed FFT processor was designed in hardware description language (HDL) and synthesized to gate-level circuits using 0.18um CMOS standard cell library. With the proposed architecture, the gate count for the processor is 46K and the size of memory is 64Kbits, which are reduced by 16% and 27%, respectively, compared with those of the 4-channel radix-2 MDC (R2MDC) FFT processor.

A Base Station Clustering Method Based on Sequential Selection Approach (순차적 선택 기반의 전송 기지국 클러스터 형성 방법)

  • Yoo, Hyung-Gil;Sung, Won-Jin
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.48 no.9
    • /
    • pp.1-9
    • /
    • 2011
  • In this paper, we propose an efficient method to create clusters of geographically distributed base stations which cooperatively transmit signals in cellular mobile communication systems. The proposed method utilizes a sequential selection approach to choose candidate base stations which can provide maximum weighted sum-rate gain when they participate in the cooperative transmission with the existing cluster. In particular, the proposed method limits the maximum number of base stations in a cluster by considering the system operational and implementation complexities. Moreover, the combinations of clusters dynamically change along with variations of channel environments. Through computer simulations, performance of the proposed method is verified by comparing with the non-cooperative transmission method and the static clustering method. Numerical result shows that the proposed sequential selection based clustering method is especially advantageous for the performance improvement of lower percentile users in terms of average throughput, and thus the proposed method can effectively improve the fairness among users.