• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제17권5호
• /
• pp.1503-1515
• /
• 2023

This paper considers the jointly active and passive beamforming design in the IRS-aided MISO downlink vehicle communication system where both V2I and V2V communication paradigms coexist. We formulate the problem as an optimization problem aiming to minimize the total transmit power of the base station subject to SINR requirements of both V2I and V2V users, total transmit power of base station and IRS's phase shift constraints. To deal with this non-convex problem, we propose a method which can alternately optimize the active beamforming at the base station and the passive beamforming at the IRS. By using first-order Taylor expansion, matrix analysis theory and penalized convex-concave process method, the non-convex optimization problem with coupled variables is converted into two decoupled convex sub-problems. The simulation results show that the proposed alternate optimization algorithm can significantly decrease the total transmit power of the vehicle base station.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권6호
• /
• pp.1418-1432
• /
• 2013

This paper studies the problem of secure information exchange between two sources via multiple relays in the presence of an eavesdropper. To this end, we propose a relay beamforming scheme, i.e., relay beamforming with artificial noise (RBwA), where the relay beamforming vector and the artificial noise vector are jointly designed to maintain the received signal-to-interference-ratio (SINR) at the two sources over a predefined Quality of Service (QoS) threshold while limiting the received SINR at the eavesdropper under a predefined secure threshold. For comparison, the relay beamforming without artificial noise (RBoA) is also considered. We formulate two optimization problems for the two schemes, where our goal is to seek the optimal beamforming vector to minimize the total power consumed by relay nodes such that the secrecy of the information exchange between the two sources can be protected. Since both optimization problems are nonconvex, we solve them by semidefinite program (SDP) relaxation theory. Simulation results show that, via beamforming design, physical layer secrecy of two-way relay networks can be greatly improved and our proposed RBwA outperforms the RBoA in terms of both low power consumption and low infeasibility rate.

• 한국통신학회논문지
• /
• 제31권3A호
• /
• pp.249-253
• /
• 2006

본 논문에서는 CDMA2000 역방향 링크에서 DS/CDMA 용 rake structure antenna away에 적용되는 새로운 방식의 simplex downhill 최적화 기법 빔포밍 알고리즘을 제안하고 있다. 본 논문에서 제안한 방법은 요구되는 신호(파일럿) 분산 행렬과 간섭 분산 행렬을 사용하고 있으며, 빔포밍 가중치들은 simplex downhill 최적화 알고리즘을 사용하여 최대 SINR 기준에 따라 만들어 졌다. 본 논문에서 제안한 구조는 기존의 적응 빔포밍 알고리즘보다 더 적은 계산량, 개선된 수렴 속도와 성능을 제공한다. Simplex downhill 방법은 최적화되기 위한 결정함수의 값만을 요구하기 때문에 최적화되거나 준최적화된 가중치 벡터를 찾기에 적합한 방식이다. 또한 rake beamformer 성능을 공간 채널모델에서의 여러종류 파라미터 값에 대하여 분석하였으며, 기존 방식의 rake 수신기와 제안된 방식을 동일한 수신 전력에서 비교 분석하였다.

• Journal of Communications and Networks
• /
• 제13권4호
• /
• pp.327-338
• /
• 2011

With the incitation to reduce power consumption and the aggressive reuse of spectral resources, there is an inevitable trend towards the deployment of small-cell networks by decomposing a traditional single-tier network into a multi-tier network with very high throughput per network area. However, this cell size reduction increases the complexity of network operation and the severity of cross-tier interference. In this paper, we consider a downlink two-tier network comprising of a multiple-antenna macrocell base station and a single femtocell access point, each serving multiples users with a single antenna. In this scenario, we treat the following beamforming optimization problems: i) Total transmit power minimization problem; ii) mean-square error balancing problem; and iii) interference power minimization problem. In the presence of perfect channel state information (CSI), we formulate the optimization algorithms in a centralized manner and determine the optimal beamformers using standard convex optimization techniques. In addition, we propose semi-decentralized algorithms to overcome the drawback of centralized design by introducing the signal-to-leakage plus noise ratio criteria. Taking into account imperfect CSI for both centralized and semi-decentralized approaches, we also propose robust algorithms tailored by the worst-case design to mitigate the effect of channel uncertainty. Finally, numerical results are presented to validate our proposed algorithms.

• ETRI Journal
• /
• 제29권1호
• /
• pp.50-58
• /
• 2007

Robust adaptive beamforming based on worst-case performance optimization is investigated in this paper. It improves robustness against steering vector mismatches by the approach of diagonal loading. A closed-form solution to optimal loading is derived after some approximations. Besides reducing the computational complexity, it shows how different factors affect the optimal loading. Based on this solution, a performance analysis of the beamformer is carried out. As a consequence, approximated closed-form expressions of the source-of-interest power estimation and the output signalto-interference-plus-noise ratio are presented in order to predict its performance. Numerical examples show that the proposed closed-form expressions are very close to their actual values.

• 한국통신학회논문지
• /
• 제34권11A호
• /
• pp.822-830
• /
• 2009

The spectrum efficiency of mobile communication networks can be improved dramatically adopting multiple antennas technologies. In order to guarantee the licensed rights of primary user (PU), the cognitive radio system should perform in a relatively low interference manner when it gets access to the spectrum of licensed networks. In this paper, we explore a uniformly distributed circular antenna array to implement beamforming algorithm that is accomplished by optimization method at the base station of cognitive radio networks, and therefore we can suppress the interference to PU by steering quite low transmission power toward PU and constructing a narrow beam toward cognitive user (CU). By reducing the constraint number of the optimization problem, we also propose a null steering algorithm that steers rather low radiation power toward PU, while the other areas in the same cell are covered by radiation power except the local area around PU. It is pursued to reduce the computation load and enlarge the capacity of cognitive radio networks extremely. The simulation results demonstrate that the proposed algorithms process superior performance.

• ETRI Journal
• /
• 제34권6호
• /
• pp.879-884
• /
• 2012

When the number of users is finite, the performance improvement of the orthogonal random beamforming (ORBF) scheme is limited in high signal-to-noise ratio regions. In this paper, to improve the performance of the ORBF scheme, the user set and transmit power allocation are jointly determined to maximize sum rate under the total transmit power constraint. First, the transmit power allocation problem is expressed as a function of a given user set. Based on this expression, the optimal user set with the maximum sum rate is determined. The suboptimal procedure is also presented to reduce the computational complexity, which separates the user set selection procedure and transmit power allocation procedure.

• ETRI Journal
• /
• 제36권4호
• /
• pp.625-634
• /
• 2014

This paper studies a dual-hop multiple-access relay network where two independent source nodes transmit information to a common destination node with the aid of multiple single-antenna amplify-and-forward relays. Each relay node is subject to an individual power constraint. We focus on the design of distributed beamforming schemes for the relays to support the transmission rate requirements of the two sources. To this end, we first characterize the achievable rate region for this network via solving a sequence of corner point optimization problems proposed in this paper. We also develop several low-complexity suboptimal schemes in closed form. Two inner bounds of the achievable rate region are theoretically shown to be approximately optimal in two special scenarios. Finally, numerical results demonstrate the effectiveness of our proposed approaches.

• 대한음성학회지:말소리
• /
• 제66호
• /
• pp.73-86
• /
• 2008

Beamforming is one of the spatial filtering techniques which extract only desired signals from noisy environments using microphone arrays. Fixed beamforming is a simple concept and easy to implement. However, it does not show good performance in real noisy conditions. As an adaptive beamforming, Frost algorithm can be a good candidate. It uses the concept of the linearly constrained minimum variance (LCMV) algorithm. The difference between the Frost and the LCMV algorithm is the error correction scheme which is very effective feature in the aspect of performance. In this paper, as quadrature mirror filtering (QMF)-based filterbank is utilized as the pre-processing of the Frost beamformning, the filter length and the learning rate of each band is optimized to improve the performance. The performance is measured by the signal-to-noise ratio (SNR) and the Bark's scale spectral distortion (BSD).

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권1호
• /
• pp.1-19
• /
• 2020

In an underlay cognitive simultaneous wireless information and power transfer (SWIPT) network, communication from secondary user (SU) to secondary destination (SD) is accomplished with decode-and-forward (DF) relays. Multiple energy-constrained relays are assumed to harvest energy from SU via power splitting (PS) protocol and complete SU secure information transmission with beamforming. Hence, physical layer security (PLS) is investigated in cognitive SWIPT network. In order to interfere with eavesdropper and improve relay's energy efficiency, a destination-assisted jamming scheme is proposed. Namely, SD transmits artificial noise (AN) to interfere with eavesdropping, while jamming signal can also provide harvested energy to relays. Beamforming vector and power splitting ratio are jointly optimized with the objective of SU secrecy capacity maximization. We solve this non-convex optimization problem via a general two-stage procedure. Firstly, we obtain the optimal beamforming vector through semi-definite relaxation (SDR) method with a fixed power splitting ratio. Secondly, the best power splitting ratio can be obtained by one-dimensional search. We provide simulation results to verify the proposed solution. Simulation results show that the scheme achieves the maximum SD secrecy rate with appropriate selection of power splitting ratio, and the proposed scheme guarantees security in cognitive SWIPT networks.