• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1A
• /
• pp.34-40
• /
• 2009

In this paper, we derive the average received beampattern at each receive node which is randomly distributed within a disk when considering a collaborative beanforming between transmission nodes which are randomly distributed within another disk for ad hoc sensor network. Numerical results show that the radius of disk at the transmitter determines the beamwidth of mainbeam, and the sidebeam is affected by the number of transmitter nodes. We also consider K receive groups and divide the transmit sensor modes into K groups to support each receive group using beamforming, and derive the SINR at each receive node. Finally, we investigate the effects of beampattern and interference on total sum capacity among all receive node, and numerically determine the number of transmit nodes for each group which can achieve the maximal sum capacity.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.11 no.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.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.2
• /
• pp.219-226
• /
• 2013

Distributed multi-hop relay scheme to reduce delay-constrained outage probability for broadcast network is proposed. We consider multi-hop relay scheme, which is similar to distributed beamforming, where multiple nodes simultaneously relay packets, and we propose channel access control and power control for relaying nodes to satisfy energy constraint. Compared with flooding which is multi-hop relay scheme used for ZigBee, the proposed scheme is better in terms of outage probability and average reception throughput.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.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.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2004.05a
• /
• 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.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.14 no.9 s.90
• /
• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.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)
• /
• v.8 no.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
• /
• v.15 no.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.