• Journal of Communications and Networks
• /
• 제12권4호
• /
• pp.358-365
• /
• 2010

We develop a low complexity cooperative diversity protocol for low energy adaptive clustering hierarchy (LEACH) based wireless sensor networks. A cross layer approach is used to obtain spatial diversity in the physical layer. In this paper, a simple modification in clustering algorithm of the LEACH protocol is proposed to exploit virtual multiple-input multiple-output (MIMO) based user cooperation. In lieu of selecting a single cluster-head at network layer, we proposed M cluster-heads in each cluster to obtain a diversity order of M in long distance communication. Due to the broadcast nature of wireless transmission, cluster-heads are able to receive data from sensor nodes at the same time. This fact ensures the synchronization required to implement a virtual MIMO based space time block code (STBC) in cluster-head to sink node transmission. An analytical method to evaluate the energy consumption based on BER curve is presented. Analysis and simulation results show that proposed cooperative LEACH protocol can save a huge amount of energy over LEACH protocol with same data rate, bit error rate, delay and bandwidth requirements. Moreover, this proposal can achieve higher order diversity with improved spectral efficiency compared to other virtual MIMO based protocols.

• Journal of Communications and Networks
• /
• 제11권1호
• /
• pp.20-25
• /
• 2009

The maximum likelihood detection with QR decomposition and M-algorithm (QRM-MLD) has been presented as a suboptimum multiple-input multiple-output (MIMO) detection scheme which can provide almost the same performance as the optimum maximum likelihood (ML) MIMO detection scheme but with the reduced complexity. However, due to the lack of parallelism and the regularity in the decoding structure, the conventional QRM-MLD which uses the tree-structure still has very high complexity for the very large scale integration (VLSI) implementation. In this paper, we modify the tree-structure of conventional QRM-MLD into trellis-structure in order to obtain high operational parallelism and regularity and then apply the Viterbi algorithm to the QRM-MLD to ease the burden of the VLSI implementation.We show from our selected numerical examples that, by using the QRM-MLD with our proposed trellis-structure, we can reduce the complexity significantly compared to the tree-structure based QRM-MLD while the performance degradation of our proposed scheme is negligible.

• 전자공학회논문지
• /
• 제50권1호
• /
• pp.21-26
• /
• 2013

본 논문에서는 그룹(group)을 2개의 심볼(symbol)로 나누는 시스템을 제안하는데, 이 두 개의 더해진 심볼들은 다중화에 의해 분리된 후 역다중화 기술을 이용해 다시 합해진다. 제안된 시스템에서 간단한 PIC(Partial Interference Cancelation) 그룹 복호화 기술은 Double-ABBA(D-ABBA) 유사 직교(Quasi-Orthogonal) 시공간 부호(Space Time Code)를 위해 사용된다. 이 부호는 고차 MIMO(Multiple Input Multiple Output) 시공간 블록 부호화에서 복호화시에 복잡도를 줄여준다. 그리고 기존의 방법과 제안된 방법과의 성능을 비교한다.

• Journal of Communications and Networks
• /
• 제7권3호
• /
• pp.307-312
• /
• 2005

In this work, we study the performance of a serial concatenated scheme comprising a convolutional code (CC) and an orthogonal space-time block code (STBC) separated by an inter-leaver. Specifically, we derive performance bounds for this concatenated scheme, clearly quantify the impact of using a CC in conjunction with a STBC, and compare that to using a STBC code only. Furthermore, we examine the impact of performing antenna selection at the receiver on the diversity order and coding gain of the system. In performing antenna selection, we adopt a selection criterion that is based on maximizing the instantaneous signal-to­noise ratio (SNR) at the receiver. That is, we select a subset of the available receive antennas that maximizes the received SNR. Two channel models are considered in this study: Fast fading and quasi-static fading. For both cases, our analyses show that substantial coding gains can be achieved, which is confirmed through Monte-Carlo simulations. We demonstrate that the spatial diversity is maintained for all cases, whereas the coding gain deteriorates by no more than $10\;log_{10}$ (M / L) dB, all relative to the full complexity multiple-input multiple-output (MIMO) system.

• Journal of Communications and Networks
• /
• 제12권2호
• /
• pp.130-139
• /
• 2010

Environmental issues and the need to reduce energy consumption for lowering operating costs have pushed power efficiency to become one of the major issues of current research in the field of wireless networks. This paper addresses a number of multiple input multiple output (MIMO) precoding and scheduling techniques across the PHY and MAC layers that can operate under a reduced link budget and collectively improve the transmit power efficiency of a base station, while maintaining the same levels of service. Different MIMO transmission and precoding schemes proposed for LTE, achieving varying degrees of multiuser diversity in both the time, frequency as well as the space domain, are examined. Several fairness-aware resource allocation algorithms are applied to the considered MIMO schemes and a detailed analysis of the tradeoffs between power efficiency and quality of service is presented. This paper explicitly examines the performance of a system serving real-time, VoIP traffic under different traffic loading conditions and transmit power levels. It is demonstrated that by use of efficient scheduling and resource allocation techniques significant savings in terms of consumed energy can be achieved, without compromising QoS.

• 한국통신학회논문지
• /
• 제36권1C호
• /
• pp.37-47
• /
• 2011

본 논문에서는 다중 입출력 (multiple-input multiple-output: MIMO) 시스템을 위한 깊이 우선 탐색과 (depth-first search) 너비 우선 탐색의 (breadth-first search) 혼용을 바탕으로 한 복호 기법을 제안한다. 제안된 기법은 먼저 탐색 트리를 여러 단계로 나눈 뒤, 깊이 우선 탐색과 너비 우선 탐색 기법 모두의 장점을 이끌어 낼 수 있도록 두 기법의 유기적인 적용을 통하여 각 단계를 탐색한다. 또한, 성능 평가를 통해 두 탐색 기법이 적절히 적용되었을 때, 기존의 복호 기법들보다 상당히 낮은 연산 복잡도를 갖는 것을 확인할 수 있다.

• Journal of Communications and Networks
• /
• 제10권2호
• /
• pp.186-193
• /
• 2008

A two-hop multiple-input multiple-output (MIMO) relay network which comprises a multiple antenna source, an amplify-and-forward MIMO relay and many potential users are studied in this paper. Consider the achievable sum rate as the performance metric, a joint design method for the processing units of the BS and relay node is proposed. The optimal structures are given, which decompose the multiuser MIMO relay channel into several parallel single-input single-output relay channels. With these structures, the signal-to-noise ratio at the destination users is derived; and the power allocation is proved to be a convex problem. We also show that high sum rate can be achieved by pairing each link according to its magnitude. The sum rate of three broadcast strategies, time division multiple access (TDMA) to the strongest user, dirty paper coding (DPC), and beamforming (BF) are investigated. The sum rate bounds of these strategies and the sum capacity (achieved by DPC) gain over TDMA and BF are given. With these results, it can be easily obtained that how far away TDMA and BF are from being optimal in terms of the achievable sum rate.

• 전자공학회논문지
• /
• 제52권3호
• /
• pp.19-24
• /
• 2015

본 논문에서는 massive multiple-input multiple-output (MIMO) 기반의 wireless powered communication network (WPCN)에서 에너지 효율을 향상시키기 위한 기지국 안테나 수 최적화 기법을 제안한다. 제안하는 기법은 massive MIMO 시스템의 채널 hardening 특성을 이용하여 채널 이득을 안테나 수에 대한 식으로 근사한다. 그리고 근사화 된 최적화 문제에 편미분을 적용한 후 Lambert-W 함수를 이용하여 최적해를 closed form으로 찾는다. 모의실험을 통해 제안하는 기법의 근사 과정과 최적화 문제를 해결하는 방법이 적절함을 보이고, closed form 해가 exhaustive search 방법으로 찾은 해와 오차가 크지 않음을 확인한다.

• 한국정보통신학회논문지
• /
• 제19권10호
• /
• pp.2275-2284
• /
• 2015

본 논문에서는 4 × 4 multiple input multiple output-orthogonal frequency division multiplexing (MIMO-OFDM) 시스템에서 사용 가능한 Walsh 부호화된 시간영역 훈련신호를 설계하고 채널 추정 방법을 제안하였다. 제안된 방법은 다중 경로 지연신호에 의하여 발생되는 훈련 신호간 상호간섭를 고려하면서 채널 응답 추정 공식을 closed-form으로 유도하였다. 컴퓨터 모의 실험결과 제안된 방법은 기존의 방법[9,14]에 비하여 성능이 우수하고 직교 훈련신호 설계시 대역폭을 증가시키지 않으며 4 × 4 MIMO-OFDM 시스템에서 널(null) 부반송파 존재하여도 채널 추정이 수행될 수 있음을 보였다.

• Journal of information and communication convergence engineering
• /
• 제18권1호
• /
• pp.1-7
• /
• 2020

This paper proposes a fast-processing and low-cost hardware multiple input multiple output (MIMO) channel emulator. The channel emulator is an important component of hardware-based simulation systems. The novelty of this work is the use of sharing and pipelining functions to reduce hardware resource utilization while maintaining a high sample rate. In our proposed emulator, the samples are created sequentially and interpolated to ensure the sample rate is equal to the base band rate. The proposed 4 × 4 MIMO requires low-cost hardware resource so that it can be implemented on a single field-programmable gate array (FPGA) chip. An implementation on Xilinx Virtex-7 VX980T was found to occupy 10.47% of the available configurable slice registers and 12.58% of the FPGA's slice lookup tables. The maximum frequency of the proposed emulator is 758.064 MHz, so up to 560 different paths can be processed simultaneously to generate 560 × 758 million × 2 × 32 bit complex-valued fading samples per second.