The search functionality is under construction.
The search functionality is under construction.

Keyword Search Result

[Keyword] time-division multiple access(2hit)

1-2hit
  • Forward Link Performance of TDMA/W-CDMA Spectrum Overlaid System with Interference Cancellation for Future Wireless Communications

    Jie ZHOU  Hisakazu KIKUCHI  Shigenobu SASAKI  Shogo MURAMATSU  Yoshikuni ONOZATO  

     
    PAPER

      Vol:
    E85-A No:7
      Page(s):
    1536-1545

    In this paper, the co-existence of TDMA and W-CDMA spectrum sharing system (TDMA/W-CDMA overlaid system) with cellular architecture is discussed. In this system, both systems share the same frequency band to improve the spectrum efficiency. Overall rate, bit error ratio (BER) and spectrum efficiency of the system are calculated for the forward link (down-link) in the presence of AWGN channel. Taking into account the path loss and shadow fading loss in this system with cellular architecture, W-CDMA applying interference cancellation (IC) shows a substantial difference in spectrum efficiency, the overlaid system can provide a greater overall rate and higher spectrum efficiency than a single multiple access-based system such as TDMA system or W-CDMA system. The interference cancellation can significantly improve BER of the spectrum overlaid system.

  • Generalized Satellite Beam-Switching Modes

    Yiu Kwok THAM  

     
    PAPER-Switching and Communication Processing

      Vol:
    E80-B No:10
      Page(s):
    1523-1528

    Satellite beam-switching problems are studied where there are m up-link beams, n down-link beams and multiple carriers per beam. By augmenting a traffic matrix with an extra row and column, it is possible to find a sequence of switching modes ((0,1)-matrices with genrally multiple unit entries in each row and column) that realize optimal transmission time. Switching modes generated are shown to be linearly independent. The number of switching modes required for an mn matrix is bounded by (m1)(n1)1. For an augmented (m1)(n1) matrix, the bound is then mn1. The bounds on the number of switching modes and the computational complexity for a number of related satellite transmission scheduling problems are lowered. In simplified form, the results (particularly the linear independence of permutation matrices generated) apply to algorithmic decomposition of doubly stochastic matrices into convex combinations of permutation matrices.