• 제목/요약/키워드: multiuser access

검색결과 119건 처리시간 0.019초

Spatial Multiuser Access for Reverse Link of Multiuser MIMO Systems

  • 신오순
    • 한국통신학회논문지
    • /
    • 제33권10A호
    • /
    • pp.980-986
    • /
    • 2008
  • Spatial multiuser access is investigated for the reverse link of multiuser multiple-input multiple-output (MIMO) systems. In particular, we consider two alternative a aches to spatial multiuser access that adopt the same detection algorithm at the base station: one is a closed-loop approach based on singular value decomposition (SVD) of the channel matrix, whereas the other is an open-loop approach based in space-time block coding (STBC). We develop multiuser detection algorithms for these two spatial multiuser access schemes based on the minimum mean square error (MMSE) criterion. Then, we compare the bit error rate (BER) performance of the two schemes and a single-user MIMO scheme. Interestingly, it is found that the STBC approach can provide much better BER performance than the SVD approach as well as than a single-user MIMO scheme.

동기화된 부호 분할 다원 접속 채널을 위한 ML 최적 다중 사용자 검출기의 간단한 계산 알고리즘 (A simple computational algorithm of ML optimum multiuser detector for synchronous code division multiple access channels)

  • 권형욱;최태영;오성근
    • 전자공학회논문지A
    • /
    • 제33A권5호
    • /
    • pp.1-9
    • /
    • 1996
  • In this paper, we propose an efficient computational algorithm that can reduce significantly the computational complexity of the ML optimum multiuser detector known as the most excellent detector in synchronous code division multiple access channels. The proposed detector uses the sequential detection algorithm based on the alternating maximization appraoch to obtain the ML estimates. As initial estimates for this sequential algorithm, we can use the estimated values obtained by the conventional single-user detector, the linear decorrelating multiuser detector, or the decorrelating decision-feedback muliuser detector, the linear decorrelating multiuser detector, or the decorrelating decision-feedback multiuser detector. We have performed computer simulations in order to see the convergence behaviors and the detection performance of the propsoed algorithm in terms of initial algorithms and the number of users, and then to compare the computational complexity with that of the ML optimum multiuser detector. From the results, we have seen that the proposed alternating maximization detector has nearly equal detction performance with that of the ML optimum multiuser detctor in only a few iteration.

  • PDF

CDMA를 위한 결정 궤환 블라인드 적응 다중 사용자 검출기 (Decision-feedback Blind Adaptive Multiuser Detector For Synchronous CDMA System)

  • 변건식;김성곤;김재수
    • 한국통신학회논문지
    • /
    • 제27권3B호
    • /
    • pp.220-225
    • /
    • 2002
  • 다수의 사용자가 추적되고 상대방의 신호에서 비롯되는 간섭 신호들을 제거하는 다중 사용자 검출 기술은 다중 간섭 효과를 줄여주고 시스템 용량을 증가시킨다. 본 논문은 동기 CDMA 시스템을 위해 블라인드 적응 다중 사용자 검출기를 발전시킨 것으로 심벌 오율 성능을 증가시키기 위해 결정 궤환 블라인드 적응 다중사용자 검출기를 제안하여, 블라인드 적응 다중 사용자 검출기와 비교하였으며, 시뮬레이션 결과 제시한 검출기가 성능이 향상됨을 확인하였다.

Random Access Channel with Retransmission Gain

  • Shi, Junmin;Sun, Yi;Zhang, Xiaochen;Xiao, Jizhong
    • IEIE Transactions on Smart Processing and Computing
    • /
    • 제2권3호
    • /
    • pp.148-159
    • /
    • 2013
  • An analysis of the throughput and stability region of random access systems is currently of interest in research and industry. This study evaluated the performance of a multiuser random access channel with a retransmission gain. The channel was composed of a media access control (MAC) determined by the transmission probabilities and a multiuser communication channel characterized by the packet reception probabilities as functions of the number of packet transmissions and the collision status. The analysis began with an illustrative two-user channel, and was extended to a general multiuser channel. For the two-user channel, a sufficient condition was derived, under which the maximum throughput was achieved with a control-free MAC. For the channel with retransmission gain, the maximum steady throughput was obtained in a closed form. The condition under which the random access channel can acquire retransmission gain was also obtained. The stability region of the general random access channel was derived. These results include those of the well-known orthogonal channel, collision channel and slotted Aloha channel with packet reception as a special instance. The analytical and numerical results showed that exploiting the retransmission gain can increase the throughput significantly and expand the stability region of the random access channel. The analytical results predicted the performance in the simulations quite well.

  • PDF

A General Method for Error Probability Computation of UWB Systems for Indoor Multiuser Communications

  • Durisi, Giuseppe;Tarable, Alberto;Romme, Jac;Benedetto, Sergio
    • Journal of Communications and Networks
    • /
    • 제5권4호
    • /
    • pp.354-364
    • /
    • 2003
  • A general method for the evaluation of the symbol error probability (SER) of ultra wideband (UWB) systems with various kind of modulation schemes (N-PAM, M-PPM, Bi-Orthogonal), in presence of multipath channel, multiuser and strong narrowband interference, is presented. This method is shown to be able to include all the principal multiaccess techniques proposed so far for UWB, time hopping (TH), direct sequence (DS) and optical orthogonal codes (OOC). A comparison between the performance of these multiple access and modulation techniques is given, for both ideal Rake receiver and minimum mean square error (MMSE) equalizer. It is shown that for all the analyzed multiple access schemes, a Rake receiver exhibits a high error floor in presence of narrowband interference (NBI) and that the value of the error floor is in-fluenced by the spectral characteristics of the spreading code. As expected, an MMSE receiver offers better performance, representing a promising candidate for UWB systems. When the multiuser interference is dominant, all multiple access techniques exhibit similar performance under high-load conditions. If the number of users is significantly lower than the spreading factor, then DS outperforms both TH and OOC. Finally 2PPM is shown to offer better performance than the other modulation schemes in presence of multiuser interference; increasing the spreading factor is proposed as a more effective strategy for SER reduction than the use of time diversity.

멀티 레이트 CDMA환경에서의 홉필드 신경망 알고리즘을 이용한 다중 사용자 검출기법 (Multiuser Detection Using Hopfield Neural Network Algorithm in Multi-rate CDMA Communications)

  • 주양익;김용석;고한석;차균현
    • 한국통신학회논문지
    • /
    • 제27권3B호
    • /
    • pp.188-195
    • /
    • 2002
  • 본 논문에서는 멀티 레이트 부호분할 다중접속(Code Division Multiple Access: CDMA) 방식에서의 효과적인 다중 사용자 검출 기술을 제안한다. 최적 다중 사용자 검출 기술이 최적의 비트 오류 확률(Bit Error Rate: BER) 성능을 보이긴 하지만, 실제 구현을 위해서는 계산상의 복잡도 측면에서의 문제가 있다. 따라서, 본 논문에서는 멀티 레이트 CDMA 환경에서 비교적 낮은 계산상의 복잡도를 갖는 준칙적의 다중 사용자 검출기 구조를 제안하며, 기존의 정합필터(matched filter)와 멀티 레이트 환경에서 제안된 다른 다중 사용자 검출기와의 성능 비교를 수행한다. 레일리 페이딩 환경에서의 컴퓨터 시뮬레이션을 통해 제안된 홉필em(Hopfield) 신경망(neural network) 알고리즘을 이용한 다중 사용자 검출기법의 성능이 우수함을 검증한다.

A Polynomial Complexity Optimal Multiuser Detection Algorithm Based on Monotonicity Properties

  • Quan, Qingyi
    • ETRI Journal
    • /
    • 제32권3호
    • /
    • pp.479-481
    • /
    • 2010
  • An optimal multiuser detection algorithm with a computational complexity of O(K log K) is proposed for the class of linear multiple-access systems which have constant cross-correlation values. Here the optimal multiuser detection is implemented by searching for a monotone sequence with maximum likelihood, under the ranking of sufficient statistics. The proposed algorithm is intuitive and concise. It is carried out in just two steps, and at each step only one kind of operation is performed. Also, the proposed algorithm can be extended to more complex systems having more than a single cross-correlation value.

Error Control Coding and Space-Time MMSE Multiuser Detection in DS-CDMA Systems

  • Hamouda, Walaa;McLane, Peter J.
    • Journal of Communications and Networks
    • /
    • 제5권3호
    • /
    • pp.187-196
    • /
    • 2003
  • We consider the use of error control coding in direct sequence-code-division multiple access (OS-COMA) systems that employ multiuser detection (MUO) and space diversity. The relative performance gain between Reed-Solomon (RS) code and convolutional code (CC) is well known in [1] for the single user, additive white Gaussian noise (AWGN) channel. In this case, RS codes outperform CC's at high signal-to-noise ratios. We find that this is not the case for the multiuser interference channel mentioned above. For useful error rates, we find that soft-decision CC's to be uniformly better than RS codes when used with DS-COMA modulation in multiuser space-time channels. In our development, we use the Gaussian approximation on the interference to determine performance error bounds for systems with low number of users. Then, we check their accuracy in error rate estimation via system's simulation. These performance bounds will in turn allow us to consider a large number of users where we can estimate the gain in user-capacity due to channel coding. Lastly, the use of turbo codes is considered where it is shown that they offer a coding gain of 2.5 dB relative to soft-decision CC.

협동 릴레이와 다중 사용자 다이버시티를 이용하는 무선 통신 네트워크의 용량 분석 (Capacity of Multiuser Diversity with Cooperative Relaying in Wireless Networks)

  • 정희진;문철;서정태;유강희
    • 한국통신학회논문지
    • /
    • 제33권6C호
    • /
    • pp.423-428
    • /
    • 2008
  • 본 논문은 다중 사용자 다이버시티를 운용하는 무선 네트워크에서 협동 다이버시티를 사용할 경우, 하향링크 채널에서 다중사용자 다이버시티와 협동 다이버시티 사이의 상호작용을 분석한다. 협동 다이버시티 링크의 수신 신호 대 잡음비 분포를 감마 분포로 근사한 후, 다수의 협동 다이버시티 링크들이 fair-access 스케줄링 되는 단일 셀에서의 평균 용량을 해석적으로 구한다. 제안하는 해석방법을 시뮬레이션 결과와 비교하여 검증하였으며, 각 링크에서 수신 신호 대 잡음비의 변동을 줄여주는 협동 다이버시티가 다수 링크들의 수신 신호 대 잡음비의 변동성을 이용하는 다중 사용자 다이버시티의 성능을 저하시킴을 용량 분석을 통하여 보여준다.

Gradient Guided 탐색을 이용한 고속 CDMA 다중사용자 검출 (Fast Multiuser Detection in CDMA Systems Using Gradient Guided Search)

  • 최양호
    • 산업기술연구
    • /
    • 제24권B호
    • /
    • pp.143-148
    • /
    • 2004
  • We present a fast algorithm for CDMA (code division multiple access) multiuser detection using the gradient guided search. The fast algorithm calculates the maximum likelihood (ML) metric so efficiently that it needs only O(K) additions in the presence of K users once some initialization is completed. The computational advantages of the fast algorithm over the conventional method are more noticeable as more iterations are required to obtain a suboptimal solution as in the initialization with matched filters.

  • PDF