Wireless network

Combinatorics

Physics

Channel (broadcasting)

Topology (electrical circuits)

Multiplexing

Relay

Computer network

Mathematics

Wireless

Bit error rate

Cooperative diversity

Algorithm

Code word

Network packet

Space–time code

Mathematical analysis

Linear network coding

Asynchronous communication

Block code

Power (physics)

Diversity gain

Computer science

Quantum mechanics

Fading

Orthogonal frequency-division multiplexing

Decoding methods

Telecommunications

Coding gain

Upper and lower bounds

In this paper, the error performances and diversity gains of two wireless relay networks are studied. The distributed space-time block coding in a synchronous relay network with multiple relay nodes is considered. The distributed linear dispersion code is used at the relays. The symbol (or codeword) error rate is studied in terms of upper and lower bounds through rigorous derivations, and sufficient conditions the system achieves full cooperative in two cases without and with a direct path from the source to the destination are also given. Different from the existing works, here the strict proof of the diversity gain through analyzing upper and lower bounds of SER performance is given. Finally, the orthogonal frequency division multiplexing (OFDM)-based space-time transmission scheme in asynchronous cooperative networks is also discussed.

The Symbol Error Performance and Diversity Gain of Two Wireless Relay Networks