Scheduled System Maintenance
On Friday, October 20, IEEE Xplore will be unavailable from 9:00 PM-midnight ET. We apologize for the inconvenience.
Notice: There is currently an issue with the citation download feature. Learn more.

IEEE Transactions on Communications

Issue 10 • Oct 1988

Filter Results

Displaying Results 1 - 16 of 16
  • Rearrangeability of multistage shuffle/exchange networks

    Publication Year: 1988, Page(s):1138 - 1147
    Cited by:  Papers (22)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (816 KB)

    Although a theoretical lower bound of (2 log2N-1) stages for rearrangeability of a network with N=2n inputs and outputs has been known, the sufficiency of (2 log2N-1) stages has neither been proved nor disproved. The best known upper bound for rearrangeability is (3 log2N-3) stages. It is proved that if (2 log2 View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new broadcast switching network

    Publication Year: 1988, Page(s):1128 - 1137
    Cited by:  Papers (28)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (836 KB)

    A rearrangeable broadcast switching network is proposed. Under the condition that the number of outlets (customers) is much larger that the number of source inlets (video channels), the network normally has fewer switching nodes than other approaches. The approach is based on the decomposition of the multiconnection function into two subfunction: consecutive spreading and routing. I offers modular... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exact analysis of asymmetric polling systems with single buffers

    Publication Year: 1988, Page(s):1119 - 1127
    Cited by:  Papers (34)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (604 KB)

    A unified approach to general asymmetric polling systems with a single buffer at each station is presented. Two variations of single-buffer polling system are considered: the conventional system and the buffer-relaxation system. In the conventional system, a new massage is not allowed to queue until the previous message has been completely transmitted, while in the buffer-relaxation system, a newl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimum bandwidth-distance performance in full response CPM systems

    Publication Year: 1988, Page(s):1110 - 1118
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (572 KB)

    The problem of minimizing the effective bandwidth of a binary full-response continuous-phase-modulation (CPM) signal with respect to the shape of the frequency pulse for a prescribed value of the minimum Euclidean distance, which is directly related to the error probability for high signal-to noise ratio, is considered. An analytical procedure is presented that allows the determination of the opti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Discrimination between mainlobe and sidelobe reception by signal distortion analysis

    Publication Year: 1988, Page(s):1105 - 1109
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (296 KB)

    Certain radio systems that have a narrowbeam directive antenna at one station and a low-gain antenna at the other station present a problem in discriminating between mainlobe and sidelobe reception. A discrimination method is presented that takes advantage of the fact that a broadband signal transmitted or received over a directive antenna can suffer distortions that depend on the aspect angle und... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coding techniques for partial-response channels

    Publication Year: 1988, Page(s):1163 - 1165
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (284 KB)

    A coding technique for improving the reliability of digital transmission over noisy partial-response channels with characteristics (±Dm), m=1, 2, where the channel input symbols are constrained to be ±1, is presented. In particular, the application of a traditional modulation code as an inner code of a concentrated coding scheme in which the outer code is... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Batcher-banyan self-routing network: universality and simplification

    Publication Year: 1988, Page(s):1175 - 1178
    Cited by:  Papers (36)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (392 KB)

    It is shown that the Batcher-banyan network performs as a universal self-routing switch when inputs with unassigned destinations are present. This is demonstrated by first proving that banyan networks can realize permutations represented by bitonic sequences, and then noting that the sorted output of the Batcher network can be viewed as a bitonic sequence. Two methods are proposed for reducing the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Separate codes on type-II hybrid ARQ systems

    Publication Year: 1988, Page(s):1089 - 1097
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (708 KB)

    A hybrid automatic repeat request (ARQ) system (HARQ-II) with parity retransmission for error correction, which combines ARQ and forward error correction is discussed, and the successful application of these codes to HARG-II is illustrated. A method of constructing the codes whereby conventional BCH codes can be changed into separable codes is proposed. A scheme is presented that has the advantage... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Systolic arrays for Viterbi processing in communication systems with a time-dispersive channel

    Publication Year: 1988, Page(s):1148 - 1156
    Cited by:  Papers (6)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (800 KB)

    The theory and design of systolic arrays for Viterbi processing in communication systems with a time-dispersive time-varying channel is discussed. The architecture, algorithms, and processor elements, for a two-dimensional systolic array are described. The array supports the branch metric computations required for an adaptive Viterbi processor. The array is designed so that computations propagate ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Use of the Viterbi algorithm to compute error events of trellis phase coding in order of increasing distance

    Publication Year: 1988, Page(s):1166 - 1170
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (380 KB)

    The use of the Viterbi algorithm to evaluate the minimum-distance parameters of trellis phase codes is extended to evaluate distances and paths of error events other than the free-distance event. Distances and paths are found for error events sequentially in order of increasing distance, starting with the free-distance event. Memory requirements increase slowly with the number of error events requ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Predictive ordering and linear approximation for image data compression

    Publication Year: 1988, Page(s):1179 - 1182
    Cited by:  Papers (2)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (376 KB)

    A method of efficient image coding called predictive ordering and linear approximation (POLA) is presented. By taking as reference the previously-received scan line, the pixels of the present scan line are placed in order of decreasing amplitudes. The regression line of the ordered pixels is estimated. The linear approximation is refined by computing the one-bit error pattern and by preserving the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A simple prediction method for L-band multipath fading in rough sea conditions

    Publication Year: 1988, Page(s):1098 - 1104
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (572 KB)

    Quantitative analysis of the coherent and incoherent power of sea-reflected waves at 1.5 GHz was performed using multipath-fading data obtained by field experiments. The experiments were carried out for shore-to-shore, satellite-to-shore, and satellite-to-ship paths, and antennas with gains from 13 dBi to 21 dBi were used for signal reception. Results indicate that in rough sea c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some remarks on the stability and performance of the noise shaper or sigma-delta modulator

    Publication Year: 1988, Page(s):1157 - 1162
    Cited by:  Papers (42)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (440 KB)

    The stability constraints of the noise shaper are examined for the purpose of coder design. The author shows that the presence of a limiter in the noise shaper strongly influences the stability criteria on the loop filter of a third- or higher-order coder. A third-order coder was designed according to these results for high-fidelity audio. It performs with a dynamic range of over 100 dB, and the m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructions of rate (n-1)/n punctured convolutional codes with minimum required SNR criterion

    Publication Year: 1988, Page(s):1171 - 1174
    Cited by:  Papers (21)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (388 KB)

    Rate (n-1)/n punctured convolutional codes (n up to 10 and memory length up to 8) are constructed which minimize the required signal-to-noise ratio (SNR) for a bit-error rate (BER) of 10-9 with and without the restriction of using only four different code generators. Many of these codes improve the free distance and reduce the required SNR more than half a dec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An improved sequential estimation scheme for PN acquisition

    Publication Year: 1988, Page(s):1182 - 1184
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB)

    An improved sequential estimation (ISE) pseudonoise (PN) acquisition scheme based on an extended characteristic polynomial is proposed in which the PN despreader can work or both the m sequence and the inverted m sequence. The scheme can be easily implemented by a front-end bit detector followed by full digital circuitry. The mean acquisition time of ISE is derived View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reciprocity of blocking probabilities in multiservice loss systems

    Publication Year: 1988, Page(s):1174 - 1175
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (172 KB)

    A general reciprocity relation is pointed out that is obeyed by the blocking probabilities in multiservice loss systems managed under a coordinate convex access. This in turn means that several user classes compete for a common pool of resource, the mutual differential influences on the blocking probabilities of the traffic streams are equal View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.

Aims & Scope

IEEE Transactions on Communications focuses on all telecommunications including telephone, telegraphy, facsimile, and point-to-point television by electromagnetic propagation.

 

 

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Naofal Al-Dhahir
University of Texas at Dallas