A perspective on multiaccess channels (Q3715010)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3943697
Language Label Description Also known as
default for all languages
No label defined
    English
    A perspective on multiaccess channels
    scientific article; zbMATH DE number 3943697

      Statements

      A perspective on multiaccess channels (English)
      0 references
      0 references
      1985
      0 references
      random multiple-access
      0 references
      achievable rate regions
      0 references
      achievable error probabilities
      0 references
      random coding
      0 references
      survey
      0 references
      slotted ALOHA system with Poisson arrivals
      0 references
      homogeneous Markov chain
      0 references
      conflict resolution algorithms
      0 references
      The author gives a review of the results related to the information approach and the collision resolution approach to multiaccess channels. In the information theoretic approach he quotes the most fundamental problems which concern coding theorems of information theory. The author considers the multiaccess channel (with or without AWGN) with two sources - which are encoded independently - in terms of their simultaneous (parallel) or random-collision access to the channel. He presents the achievable rate regions for these sources as well as achievable error probabilities for both types of channels, assuming that successive letters in random coding ensembles are independent or statistically dependent. Next he gives a short survey of coding techniques that are applicable for a large set of transmitters, discussing at some length convolutional codes. Finally, the author considers the collision resolution approach, defining the slotted ALOHA system with Poisson arrivals. He describes the system as a homogeneous Markov chain and presents some conflict resolution algorithms.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references