• Title/Summary/Keyword: Random Channel

Search Result 510, Processing Time 0.036 seconds

Performance analysis of maximum likelihood detection for the spatial multiplexing system with multiple antennas (다중 안테나를 갖는 공간 다중화 시스템을 위한 maximum likelihood 검출기의 성능 분석)

  • Shin Myeongcheol;Song Young Seog;Kwon Dong-Seung;Seo Jeongtae;Lee Chungyong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.42 no.12
    • /
    • pp.103-110
    • /
    • 2005
  • The performance of maximum likelihood(ML) detection for the given channel is analyzed in spatially multiplexed MIMO system. In order to obtain the vector symbol error rate, we define error vectors which represent the geometrical relation between lattice points. The properties of error vectors are analyzed to show that all lattice points in infinite lattice almost surely have four nearest neighbors after random channel transformation. Using this information and minimum distance obtained by the modified sphere decoding algorithm, we formulate the analytical performance of vector symbol error over the given channel. To verify the result, we simulate ML performance over various random channel which are classified into three categories: unitary channel, dense channel, and sparse channel. From the simulation results, it is verified that the derived analytical result gives a good approximation about the performance of ML detector over the all random MIMO channels.

Derivations of Gallager Random Coding Bound by Simple Manipulations of Algebraic Inequalities (대수부등식들만을 이용한 갈라거 랜덤 코딩 바운드의 유도)

  • Yoo, Do-Sik;Lim, Jong-Tae
    • Journal of Advanced Navigation Technology
    • /
    • v.11 no.4
    • /
    • pp.447-453
    • /
    • 2007
  • In this letter, we derive the Gallager random coding bound for discrete memoryless channels purely by simple manipulations of algebraic inequalities rather than invoking conceptually difficult random coding arguments. Gallager random coding bound is a very useful tool in information and coding theory due to its applicability to situations in which it is difficult to determine the decision regions and due to the fact that it can be used to derive the channel coding theorem. The readers will find it relatively easy to apply to many practical problems of interest the step-by-step algebraic derivations of the Gallager random coding bound with appropriate modifications.

  • PDF

Adaptive Random Access Algorithm for HIPERLAN/2 (HIPERLAN/2를 위한 적응적 랜덤 액세스 알고리즘)

  • Song Young-keum;Lee Jong-kyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.5B
    • /
    • pp.310-316
    • /
    • 2005
  • In this paper, we proposed and evaluated ARAH(Adaptive Random Access algorithm for HIPERLAN/2) to improve system performance. In this paper, HIPERLAN/2 uses OFDM(Orthogonal Frequency Division Multiplexing) modulation scheme to select appropriate PHY mode by Radio Channel Quality, Proposed the ARAH scheme uses these 7 PHY mode when mobile terminal determines the RCH(Random CHannel) number for random access. In this paper, these 7 PHY mode divided into two group, good and bad, and will be given high priority to mobile terminals which are in a good group. In the result of performance evaluation. ARAH algorithm, ARAH has a better performance of throughput and delay than existing algorithm.

Performance of cellular hybrid DS/FH spread spectrum systems with diversity on nakagami fading channel (나카가미 페이딩 채널하에서 다이버시티를 갖는 셀룰러 하이브리드 DS/FH 확산대역 시스팀의 성능)

  • 조현욱;박상규
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.2
    • /
    • pp.10-21
    • /
    • 1998
  • In this paper, we analyze the anynchrous cellular hybrid DS/FH spread spectrum system with diversity on nonselective Nakagami fading channel. Binary Psk scheme is considered and random spreading code sequences and random hopping patterns are used. We compare the performance of system using hard-limiting correlation receiver with diversity and linear corrleation receiver in Nakagami fading channel. We compute the average bit error probabilities with/without diversity according to spreading code sequence and the number of hop-ping frequencies under the same handwith espansion, and analyze near-far effect. The results show that hard-limiting correlation receiver with diversity gives a good performance over severe fading channel.

  • PDF

A Simulation Study on Queueing Delay Performance of Slotted ALOHA under Time-Correlated Channels

  • Yoora Kim
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.15 no.3
    • /
    • pp.43-51
    • /
    • 2023
  • Slotted ALOHA (S-ALOHA) is a classical medium access control protocol widely used in multiple access communication networks, supporting distributed random access without the need for a central controller. Although stability and delay have been extensively studied in existing works, most of these studies have assumed ideal channel conditions or independent fading, and the impact of time-correlated wireless channels has been less addressed. In this paper, we investigate the queueing delay performance in S-ALOHA networks under time-correlated channel conditions by utilizing a Gilbert-Elliott model. Through simulation studies, we demonstrate how temporal correlation in the wireless channel affects the queueing delay performance. We find that stronger temporal correlation leads to increased variability in queue length, a larger probability of having queue overflows, and higher congestion levels in the S-ALOHA network. Consequently, there is an increase in the average queueing delay, even under a light traffic load. With these findings, we provide valuable insights into the queueing delay performance of S-ALOHA networks, supplementing the existing understanding of delay in S-ALOHA networks.

Self-Encoded Multi-Carrier Spread Spectrum with Iterative Despreading for Random Residual Frequency Offset

  • Jang, Won Mee;Chi, Liang
    • Journal of Communications and Networks
    • /
    • v.15 no.3
    • /
    • pp.258-265
    • /
    • 2013
  • In this study, we investigate the multi-carrier spread spectrum (MCSS) communication system which adopts the self-encoded spread spectrum in a downlink synchronous channel. It is very difficult to completely eliminate the frequency offset in practical channel scenarios. We demonstrate that the self-encoded MCSS (SE-MCSS) with iterative despreading manifests a remarkable immunity to residual frequency offset. The SE-MCSS can be an excellent candidate for the future generation of wireless services.

The performance analysis for intercell interference reduction techniques in WiBro networks (와이브로 기반의 셀간 간섭 제거 기술 성능 분석)

  • Park Chi-Ho;Oh Young-Hwan
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.5 s.347
    • /
    • pp.104-112
    • /
    • 2006
  • In this thesis, we analyze performance related to reduction scheme of intercell interference causing serious problems in wiBro system. Frequency reusing factor(FUF) is 1 in WiBro system, and it means that a adjacent cell uses same frequency band. This channel environment raises intercell interference problem, which provokes serious problems related to system performance and channel capacity. Consequently, it affects deterioration in system performance as a whole. We analyze intercell interference when appling a various schemes such as (DCA)Dynamic Channel Allocation, CS(Channel Segregation), IMUFR(Interference Mitigation Using Frequency Reuse), IDMA(Interleave Division Multiple Access), IDMA(Interleave Division Multiple Access), FH-OFDM, CRSA(Conceptual Random Subcarrier Allocation), and HDD

Fault Attack on a Point Blinding Countermeasure of Pairing Algorithms

  • Park, Jea-Hoon;Sohn, Gyo-Yong;Moon, Sang-Jae
    • ETRI Journal
    • /
    • v.33 no.6
    • /
    • pp.989-992
    • /
    • 2011
  • Recently, Page and Vercauteren proposed a fault attack on pairing algorithms and two countermeasures against such an attack. The countermeasure uses either a random scalar or a random point to blind the input points. To defeat the countermeasure using a random point, we utilize the point addition formula on an elliptic curve. As a result, we successfully defeat the countermeasure using a random point.

Performance Evaluation of the Common Channel Access Method in CDMA Packet Service System (CDMA 패킷 서비스 시스템에서 Common Channel Access 방법의 성능 평가)

  • Lee, Kang-Won
    • IE interfaces
    • /
    • v.17 no.3
    • /
    • pp.294-304
    • /
    • 2004
  • In the IS-95 packet service system, the radio channels are generally classified into the dedicated and common traffic channels. In this paper, the performance of the common traffic channel access method is evaluated using simulation. The simulation results are compared with those of random access method. Simulation results show that the capacity can be increased up to 25% by applying the proposed common channel access method. The delay problem and variance of BER are also discussed.

CLR Performance Improvement of Random Traffic in the Wireless ATM Access Architecture (무선 ATM 접속구조에서 랜덤 트래픽의 셀 손실율 성능개선)

  • 김철순;이하철;곽경섭
    • Journal of Korea Multimedia Society
    • /
    • v.6 no.7
    • /
    • pp.1239-1244
    • /
    • 2003
  • In this paper, we analyzed cell loss rate performance for random traffic sources in wireless ATM(Asynchronous Transfer Mode) access architecture, which consists of access node and wireless channel. Applying queueing model to cell level at access node and considering burst error characteristics in wireless channel, we derived a formula about the cell loss rate of the random traffic in the wireless ATM access architecture. We also applied FEC(Forward Error Correction) schemes to improve the cell loss rate of random traffic. When we applied FEC schemes in the wireless ATM access architecture, we confirmed that the concatenated code provides the most superior performance compared to any other codes.

  • PDF