• 検索結果がありません。

JAIST Repository: Unified Analysis on Performance Limits of Coded Multilevel DPSK in Rayleigh Fading Channels

N/A
N/A
Protected

Academic year: 2021

シェア "JAIST Repository: Unified Analysis on Performance Limits of Coded Multilevel DPSK in Rayleigh Fading Channels"

Copied!
2
0
0

読み込み中.... (全文を見る)

全文

(1)

Japan Advanced Institute of Science and Technology

JAIST Repository

https://dspace.jaist.ac.jp/

Title

Unified Analysis on Performance Limits of Coded

Multilevel DPSK in Rayleigh Fading Channels

Author(s)

Matsumoto, T.; Adachi, F.

Citation

Proceedings. 1993 IEEE International Symposium on

Information Theory, 1993.: 345-345

Issue Date

1993-01

Type

Conference Paper

Text version

publisher

URL

http://hdl.handle.net/10119/4820

Rights

Copyright (c)1993 IEEE. Reprinted from

Proceedings. 1993 IEEE International Symposium on

Information Theory, 1993. This material is posted

here with permission of the IEEE. Such permission

of the IEEE does not in any way imply IEEE

endorsement of any of JAIST's products or

services. Internal or personal use of this

material is permitted. However, permission to

reprint/republish this material for advertising

or promotional purposes or for creating new

collective works for resale or redistribution

must be obtained from the IEEE by writing to

[email protected]. By choosing to view

this document, you agree to all provisions of the

copyright laws protecting it.

(2)

Unified Analysis on Performance Limits

of

Coded Multilevel DPSK in Rayleigh Fading Channels

Tadashi MATSUMOTO, Member, IEEE and

Fumiyuki Adachi, Senior Member, B E E

R&D Department of NTT Mobile Communications Network Inc., 1-2356, Take, Yokosuka, 238, Japan

Abstract

This paper analyzes performance limits of coded multilevel differential PSK (MDPSK) in frequency selective Rayleigh fading channels. It is assumed either that interleaving degree is large enough, or that there is a sufficient bandwidth for frequency hopping, t o randomize the burst errors produced by fading. The channel cutoff rate of MDPSK is calculated based on the "Gaussian metric"; AWGN, co-channel interference and multipath channel delay spread are taken into account. For practical, reliable communications over cellular mobile radio sye,tems employing coded MDPSK, the three optimal inhrmation bit rates that achieve

1)minimum required average signal energy per information bit-to-noise power spectral density ratio (EdNo),

2)maximum tderable rms delay spread Trms, and 3)maximum spectrum efficiency

are determined from the channel cutoff rate. It is shown that without fading frequency selectivity, the optimal information bit rate (=information bits /MDPSK symbol) which minimizes the required average EdNo is around 0.25 information bits /symbol for 2DPSK, and

0.4 bits /symbol fix other MDPSK schemes with M? 4. In frequency selective fading, the lower the rate of codes for error correction, t h e higher the channel symbol rate for a given information bit rate 1/Tb, and

the transmission performance becomes more sensitive

to

the fading frequency selectivity. It is shown that a

larger Trms/Tb value can be tolerated with larger values of M. The optimal code rate for 32DPSK is around 0.3 (1.5 information bits /symbol), and the maximum

Trms/Tb value is 1.5.

In co-channel interference environments, i t i s obvious that a larger error correction capability reduces required average signal-to-interference power ratio (SIR). Therefore, the same frequency can be used in closer cells when lower rate codes are used. This increases the system spectrum efficiency. However, the lower r a t e codes r e q u i r e l a r g e r t r a n s m i s s i o n bandwidth, and this decreases the efficiency.

In the analysis of the spectrum efficiency of cellular mobile radio systems employing coded MDPSK, the service area is defined as the area in which practical, reliable communications are possible. It is shown that for a given c h a n n e l b a n d w i d t h , t h e s p e c t r u m efficiencies are maximized when the information bit rate is around 0.5 information bits /symbol for PDPSK, 1 bit /symbol for IDPSK, and 1.4 bits /symbol for other MDPSK schemes. For a given information bit rate, spectrum efficiency is increased with larger M values. The optimal code rate for 32DPSK is around 0.3, and the maximal spectrum efficiency is 2.6 times as large as that for 1 bit-per-symbol coded IDPSK.

参照

関連したドキュメント

Moreover, A is also the direct limit of this new inductive system because the approximate intertwining argument used in [10, Theorem 6] is exactly applicable to the diagram

For staggered entry, the Cox frailty model, and in Markov renewal process/semi-Markov models (see e.g. Andersen et al., 1993, Chapters IX and X, for references on this work),

(In a very recent preprint, Niethammer and Vel´azquez [9] have obtained a remarkable estimate for the effective potential of a single particle in the supercritical case by taking

The local structure of the maximal ideal space and the set of one-point Gleason parts of a Blaschke inductive limit algebra differ dras- tically from the ones of a big G-disc

We shall see below how such Lyapunov functions are related to certain convex cones and how to exploit this relationship to derive results on common diagonal Lyapunov function (CDLF)

Reshetikhin modules, and subsequently the general ones were studied in [18]. In that paper, Moura presented several conjectures for the graded limits of minimal affinizations in

Le Gall [10] showed in particular that scaling limits of random quadrangulations are homeomorphic to the Brownian map introduced by Marckert & Mokkadem [13], and Le Gall

5. Scaling random walks on graph trees 6. Fusing and the critical random graph 7.. GROMOV-HAUSDORFF AND RELATED TOPOLOGIES.. compact), then so is the collection of non-empty