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

본 논문에서는 반지름이 정해진 2차원 디스크 내부에 랜덤하게 분포된 다수개의 노드들이 존재하는 수신 그룹을 고려하여, 각각의 수신 노드들이 수신하는 평균 빔패턴을 도출하였다. 수치적 실험으로부터 송신단의 디스크의 반지름이 빔패턴이 빔폭(beamwidth)를 결정하며, 송신 노드의 수가 sidelobe의 평균에 영향을 주는 것을 볼 수 있었다. 또한 이러한 모델을 더욱 일반화 하여, 다수의 센서 노드들로 구성된 K개의 수신그룹들과, K개의 수신그룹으로 서로 다른 신호를 전송하기 위해 송신단을 K개의 그룹으로 나누어 빔포밍 하는 시스템을 고려하였다. 이 경우, 각 수신그룹간에 간섭신호가 발생하게 되는데, 본 논문에서 유도한 평균 빔패턴을 이용하여 각각의 수신 노드에서의 수신 SINR(signal-to interference-plus-noise ratio)을 도출하였다. 마지막으로, 수신단간의 빔패턴과 간섭 신호가 시스템의 성능에 어떠한 영향을 미치는지 살펴보았다. 성능의 지표로 각각의 수신 노드들의 용량(capacity)을 더한 총용량(sum capacity)를 사용하였고, 두 개의 수신 그룹을 고려할 때, 보다 좋은 성능을 갖게 되는 빔패턴을 갖도록 하는 각 그룹의 송신단 노드의 수를 수치적 실험으로부터 유도하였다.

• 한국소음진동공학회논문집
• /
• 제11권6호
• /
• pp.200-207
• /
• 2001

In this paper, a new method for Partial field decomposition is developed that is based on the beamforming algorithm for the application of acoustical holography to a composite sound field generated by multiple incoherent sound sources. In the proposed method, source Positions are first predicted by MUSIC(multiple signal classification) algorithm. The composite sound fields can then be decomposed into each partial field by the beamforming. Results of both numerical simulations and experiments show that the method can find each partial field very accurately and effectively, and that it also has Potential to be used for application to distributed sources.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2006년도 하계종합학술대회
• /
• pp.365-366
• /
• 2006

This paper describes a pre-processing methodology which can apply to remote speech recognition system of service robot in noisy environment. By combining beamforming and blind source separation, we can overcome the weakness of beamforming (reverberation) and blind source separation (distributed noise, permutation ambiguity). As this method is designed to be implemented with hardware, we can achieve real-time execution with FPGA by using systolic array architecture.

• 한국통신학회논문지
• /
• 제38C권2호
• /
• pp.219-226
• /
• 2013

본 논문에서는 수신 노드의 수가 증가하고 전달 제한 시간이 있는 브로드캐스트 센서 네트워크에서 아웃티지 확률을 감소시킬 수 있는 다중 홉 중계 방식을 제안한다. 패킷을 수신한 여러 개의 노드들이 분산 빔 형성 기법과 같이 동시에 패킷을 전송하는 다중 홉 중계 방식을 고려한다. 그리고 제한된 전달시간 내에서 패킷을 전송하는 데에 소모되는 평균 에너지 제한 조건을 만족 시키면서 패킷 수신에 성공한 모든 노드가 중계 노드로 동작하기 위한 채널 접속제어 기법과 송신 전력 제어 방식을 제안한다. 그리고 센서 네트워크 구축에 사용되는 지그비 기술의 다중 홉 브로드캐스트 중계 방식인 플러딩 기법과 비교하여 제안하는 방식의 아웃티지 확률이 더 낮아지고 평균 총 수신 전송률은 증가하게 되는 것을 실험을 통해서 보인다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권1호
• /
• pp.21-40
• /
• 2018

In this paper, we propose the distributed robust beamforming design scheme in cognitive two-way amplify-and-forward (AF) relay networks with imperfect channel state information (CSI). Assuming the CSI errors follow a complex Gaussian distribution, the objective of this paper is to design the robust beamformer which minimizes the total transmit power of the collaborative relays. This design will guarantee the outage probability of signal-to-interference-plus-noise ratio (SINR) beyond a target level at each secondary user (SU), and satisfies the outage probability of interference generated on the primary user (PU) above the predetermined maximum tolerable interference power. Due to the multiple CSI uncertainties in the two-way transmission, the probabilistic constrained optimization problem is intractable and difficult to obtain a closed-form solution. To deal with this, we reformulate the problem to the standard form through a series of matrix transformations. We then accomplish the problem by using the probabilistic approach based on two sorts of Bernstein-type inequalities and the worst-case approach based on S-Procedure. The simulation results indicate that the robust beamforming designs based on the probabilistic method and the worst-case method are both robust to the CSI errors. Meanwhile, the probabilistic method can provide higher feasibility rate and consumes less power.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2004년도 춘계학술대회논문집
• /
• pp.774-779
• /
• 2004

This paper addresses the way in which we can find where impact noise sources are. Specifically, we have an interest in the case that the signal is embedded in noise. We propose a signal processing method that can identify impulsive sources’location. The method is robust with respect to noise; spatially distributed noise. This has been achieved by a beamforming method with regard to cepstrum domain is used. It is noteworthy that the cepstrum has the ability to detect periodic pulse signal in noise. Numerical simulation and experiments are performed to verify the method. Results show that the proposed technique is quite powerful for localizing the faults in noisy environments. The method also required less microphones than conventional beamforming method.

• 한국소음진동공학회논문집
• /
• 제14권9호
• /
• pp.877-883
• /
• 2004

This paper addresses the way in which we can find where impulsive noise sources are. Specifically, we have an interest in the case that the signal is embedded in noise. We propose a signal processing method that can identify impulsive sources' location. The method is robust with respect to spatially distributed noise. This has been achieved by the modified beamforming method with regard to cepstrum domain is used. It is noteworthy that the cepstrum has the ability to detect periodic pulse signal in noise. Numerical simulation and experiments are performed to verify the method. Results show that the proposed technique is quite powerful for localizing the faults in noisy environments. The method also required less microphones than conventional beamforming method.

• 한국통신학회논문지
• /
• 제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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권12호
• /
• pp.4305-4323
• /
• 2014

In this paper, we investigate the degrees of freedom (DOF) of the Y channel consisting of three single-antenna users and a two-antenna common access relay, where each user intends to exchange independent messages with the other two users with the assistance of the relay. We show that the DOF of this particular scenario is 1.5. In order to prove this result, we firstly derive a DOF upper bound based on cut-set bound by allowing cooperation among users, which shows that the total DOF is upper bounded by 1.5. Then we propose a novel transmission scheme based on asymmetric signal space alignment (ASSA) to demonstrate the achievability of the upper bound. Theoretical evaluation and numerical results confirm that the upper bound can be achieved by utilizing ASSA, which also proves the optimality of the ASSA-based scheme in terms of DOF. Combining the upper bound and achievability, we conclude that the exact DOF is 1.5. Moreover, we present a novel iterative joint beamforming optimization (I-JBO) algorithm to further improve the sum rate. Numerical simulations have been provided to demonstrate the convergence speed and performance advantage of the I-JBO algorithm.

• Journal of Communications and Networks
• /
• 제15권4호
• /
• pp.370-382
• /
• 2013

Distributed massive MIMO systems, which have high bandwidth efficiency and can accommodate a tremendous amount of traffic using algorithms such as zero-forcing beam forming (ZFBF), may be deployed in large public venues with the antennas mounted under-floor. In this case the channel gain matrix H can be modeled as a multi-banded matrix, in which off-diagonal entries decay both exponentially due to heavy human penetration loss and polynomially due to free space propagation loss. To enable practical implementation of such systems, we present a multi-banded matrix inversion algorithm that substantially reduces the complexity of ZFBF by keeping the most significant entries in H and the precoding matrix W. We introduce a parameter p to control the sparsity of H and W and thus achieve the tradeoff between the computational complexity and the system throughput. The proposed algorithm includes dense and sparse precoding versions, providing quadratic and linear complexity, respectively, relative to the number of antennas. We present analysis and numerical evaluations to show that the signal-to-interference ratio (SIR) increases linearly with p in dense precoding. In sparse precoding, we demonstrate the necessity of using directional antennas by both analysis and simulations. When the directional antenna gain increases, the resulting SIR increment in sparse precoding increases linearly with p, while the SIR of dense precoding is much less sensitive to changes in p.