• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.1206-1210
• /
• 2005

This paper presents performance improvement in optical CDMA system under the presence of beat noise using a cancellation technique. Optical fibers and atmospheric optical communications have been proposed the connection between base stations and central station. The optical signal beat noise is due to interference between lightwave, many optical waves are simultaneously incident on each receiver photodiode. Since the photodiode acts as a square-law detector, beat noise can occur in the receiver. While A two-stage cancellation technique is analyzed and verified via simulation employed here because of its system simplicity. By using the random ingredients of all user signals are estimated, the beat noise is rebuilt and removed from the intended signal. In addition to cancellation technique cancel the inherent multiuser interference (MUI) in CDMA system and nonlinear distortion (NLD) in optical system. It is performed at the receiver of the central station where the random ingredients of all user signals are estimated and the MUI and the NLD are rebuilt and removed from the received signal. The validity of the cancellation technique is theoretically analyzed and shown by numerical results. The increasing of capacity in two stage cancellation are obtained.

• ETRI Journal
• /
• 제38권2호
• /
• pp.280-290
• /
• 2016

To implement high-order multiuser multiple input and multiple output (MU-MIMO) for massive MIMO systems, there must be a feedback scheme that can warrant its performance with a limited signaling overhead. The interference-to-noise ratio can be a basis for a novel form of Codebook (CB)-based MU-MIMO feedback scheme. The objective of this paper is to verify such a scheme's performance under a practical system configuration with a 3D channel model in various radio environments. We evaluate the performance of various CB-based feedback schemes with different types of overhead reduction approaches, providing an experimental ground with which to optimize a CB-based MU-MIMO feedback scheme while identifying the design constraints for a massive MIMO system.

• 디지털산업정보학회논문지
• /
• 제8권4호
• /
• pp.99-105
• /
• 2012

Recently, there are many user selection algorithms in multi user multiple-input multiple-output (MU-MIMO) systems. One of well-known user selection methods is Semi orthogonal user selection (SUS). It is an algorithm maximizing channel capacity. However, it is applicable only when user's antenna is one. We propose a generalized user selection algorithm regardless of the number of user's antennas. In the proposed scheme, Base station (Bs) selects the first user who has the highest determinant of channel and generates a user group that correlation with first user's channel is less than allowance of correlation. Then, each determinant of channels made up of first user's channel and a user's channel in the generated group is calculated and BS selects the next user who has the highest determinant of that. BS selects following users by repeating above procedure. In this paper, we get better performance because of selecting users who have the highest determinant of channel as well as allowance of correlation optimally calculated through matrix operations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권9호
• /
• pp.4180-4196
• /
• 2017

In this paper, we analyze average capacity of an amplify-and-forward (AF) cooperative communication system model in multi-relay multiuser networks. In contrast to conventional cooperative networks, relays in the considered network have no embedded energy supply. They need to rely on the energy harvested from the signals broadcasted by the source for their cooperative information transmission. Based on this structure, a two-step selection scheme is proposed considering both channel state information (CSI) and battery status of relays. Assuming each relay has infinite or finite energy storage for accumulating the energy, we use the infinite or finite Markov chain to capture the evolution of relay batteries and certain simplified assumptions to reduce computational complexity of the Markov chain analysis. The approximate closed-form expressions for the average capacity of the proposed scheme are derived. All theoretical results are validated by numerical simulations. The impacts of the system parameters, such as relay or user number, energy harvesting threshold and battery size, on the capacity performance are extensively investigated. Results show that although the performance of our scheme is inferior to the optimal joint selection scheme, it is still a practical scheme because its complexity is much lower than that of the optimal scheme.

• 한국통신학회논문지
• /
• 제34권9C호
• /
• pp.915-921
• /
• 2009

LLL (Lenstra-Lenstra-Lovasz) 알고리즘은 보다 좋은 채널 행렬의 기저를 얻기 위하여 주로 사용되는 격자 감소기법이다. 본 논문에서는 LRA (lattice reduction aided) 프리코딩 기법에서 채널 행렬의 기저 (basis) 벡터를 격자 감소시키기 위하여 LLL 알고리즘 대신 Seysen 알고리즘 (SA)을 사용하였으며, 기존의 선형 프리코딩 기법을 SA를 통하여 얻어진 변환된 채널 행렬에 적용하였다. SA를 통하여 LLL 알고리즘보다 높은 직교성을 가진 기저를 얻어낼 수 있으므로, SA 기반의 LRA 프리코딩 기법은 기존의 LLL 기반의 LRA 프리코딩 기법보다 우수한 성능을 가진다. 모의실험 결과를 통하여 LRA 프리코딩에서 격자 감소를 위하여 SA를 사용한 경우, LLL 알고리즘을 사용한 경우보다 target BER $10^{-5}$에서 0.5dB정도의 BER 성능 이득이 얻어짐을 입증한다.

• Journal of Communications and Networks
• /
• 제18권1호
• /
• pp.27-39
• /
• 2016

This paper derives and analyzes a novel block fast Fourier transform (FFT) based joint detection algorithm. The paper compares the performance and complexity of the novel block-FFT based joint detector to that of the Cholesky based joint detector and single user detection algorithms. The novel algorithm can operate at chip rate sampling, as well as higher sampling rates. For the performance/complexity analysis, the time division duplex (TDD) mode of a wideband code division multiplex access (WCDMA) is considered. The results indicate that the performance of the fast FFT based joint detector is comparable to that of the Cholesky based joint detector, and much superior to that of single user detection algorithms. On the other hand, the complexity of the fast FFT based joint detector is significantly lower than that of the Cholesky based joint detector and less than that of the single user detection algorithms. For the Cholesky based joint detector, the approximate Cholesky decomposition is applied. Moreover, the novel method can also be applied to any generic multiple-input-multiple-output (MIMO) system.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2000년도 추계종합학술대회
• /
• pp.235-238
• /
• 2000

본 논문에서는 BS-CDMA 이동통신 시스템에서 다중 사용자 간섭과 Rayleigh 페이딩의 영향을 효과적으로 제거하기 위하여 터보 부호화 다중 사용자 검출 방식을 사용하였으며, Monte Carlo 시뮬레이션을 이용하여 다양한 채널 조건에서 제안된 방식의 성능을 분석하였다.

• 한국통신학회:학술대회논문집
• /
• 한국통신학회 2006년도 하계종합학술발표회 논문 초록집
• /
• pp.523-523
• /
• 2006

• 한국국방경영분석학회지
• /
• 제27권1호
• /
• pp.114-127
• /
• 2001

To support cooperative work in various scenes by computer systems, functions of sharing personalization, observation and control are needed. Especially, in advanced cooperative work, people have various position so that sometimes one person needs to restrict behavior of another. In this paper, we describe representation of access restriction of hypermedia system, which is framework of CSCW(Computer-Supported Cooperative Works) system we developed and propose a way to go on working cooperatively with people, restricting others.

• 한국통신학회논문지
• /
• 제32권2A호
• /
• pp.162-168
• /
• 2007

This paper proposes two detection algorithms for Multi-user Space Time Block Code systems. The first one is linear detection Gaussian Elimination algorithm, and then it combined with Ordered Successive Cancellation to get better performance. The comparisons between receiver and other popular receivers, including linear receivers are provided. It will be shown that the performance of Gaussian Elimination receiver is similar but more simplicity than linear detection algorithms and performance of Gaussian Elimination Ordered Successive Cancellation superior as compared to other linear detection method.