Leveraging coherent distributed space-time codes for noncoherent communication in relay networks via training

Rajan, G. Susinder; Rajan, B. Sundar

doi:10.1109/twc.2009.080545

Cited by 17 publications

(5 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…, R. In a noncoherent relay network, where the terminals do not have knowledge of any of the channel gains, it is easy to estimate the product of the fading gains rather than estimating all the individual fading gains. Recently in [10], it was shown that by transmitting 1 (pilot symbol) to all the relays in the first phase and by simply amplifying and forwarding the received symbols from the relays during second phase, the destination can easily estimate f j g j , j = 1, . .…”

Section: Construction Of Two Group ML Decodable Dstbcs For Odd Nummentioning

confidence: 99%

“…, R from its received signals. Thus, DSTBCs with unitary relay matrices can be effectively applied in the training based noncoherent communication scheme of [10].…”

Section: Construction Of Two Group ML Decodable Dstbcs For Odd Nummentioning

confidence: 99%

“…• Application of DSTBCs with unitary relay matrices in the training based noncoherent communication scheme of [10] is also discussed.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Low complexity distributed STBCs with unitary relay matrices for any number of relays

Rajan¹,

Rajan

2009

2009 IEEE International Symposium on Information Theory

View full text Add to dashboard Cite

Abstract-Jing and Hassibi introduced a distributed space time block coding scheme for symbol synchronous, coherent, amplify and forward relay networks with half duplex constrained relay nodes. In this two phase transmission scheme, the source transmits a vector of complex symbols to the relays during the first phase and each relay applies a pre-assigned unitary transformation to the received vector or its conjugate before transmitting it to the destination during the second phase. The destination then perceives a certain structured distributed space time block code (DSTBC) whose maximum likelihood (ML) decoding complexity in general, is very high. In this paper, explicit constructions of minimum delay, full diversity, four group ML decodable DSTBCs with unitary relay matrices are provided for even number of relay nodes. Prior constructions of DSTBCs with the same features were either limited to power of two number of relay nodes or had non-unitary relay matrices which leads to large peak to average power ratio of the relay's transmitted signals. For the case of odd number of relays, constructions of minimum delay, full diversity, two group ML decodable DSTBCs are given.

show abstract

Section: Construction Of Two Group ML Decodable Dstbcs For Odd Nummentioning

confidence: 99%

“…, R from its received signals. Thus, DSTBCs with unitary relay matrices can be effectively applied in the training based noncoherent communication scheme of [10].…”

Section: Construction Of Two Group ML Decodable Dstbcs For Odd Nummentioning

confidence: 99%

See 1 more Smart Citation

Low complexity distributed STBCs with unitary relay matrices for any number of relays

Rajan¹,

Rajan

2009

2009 IEEE International Symposium on Information Theory

View full text Add to dashboard Cite

show abstract

“…The principal objective is to design a coding scheme that mitigates the performance degradation experienced by distributed space time coding-orthogonal frequency division multiplexing (DSTC-OFDM) schemes and distributed space-frequency coding (DSFC) schemes in severe time-selective and frequencyselective fading channels, respectively. Furthermore, in the DSTC-OFDM schemes of [1][2][3] and the DSFC schemes of [4][5][6][7][8], for example, the channel gain on adjacent OFDM [9,10] time slots and frequency sub-carriers, respectively, is assumed to remain quasi-static to facilitate signal recovery at the destination. This assumption is impractical when signals with long symbol duration are transmitted or in cases involving large numbers of cooperating nodes.…”

Section: Introductionmentioning

confidence: 99%

Co-Efficient Vector Based Differential Distributed Quasi-Orthogonal Space Time Frequency Coding

Nwanekezie,

Simpson,

Owojaiye

et al. 2023

Sensors

View full text Add to dashboard Cite

Distributed space time frequency coding (DSTFC) schemes address problems of performance degradation encountered by cooperative broadband networks operating in highly mobile environments. Channel state information (CSI) acquisition is, however, impractical in such highly mobile environments. Therefore, to address this problem, designers focus on incorporating differential designs with DSTFC for signal recovery in environments where neither the relay nodes nor destination have CSI. Traditionally, unitary matrix-based differential designs have been used to generate the differentially encoded symbols and codeword matrices. Unitary based designs are suitable for cooperative networks that utilize the amplify-and-forward protocol where the relay nodes are typically required to forego differential decoding. In considering other scenarios where relay nodes are compelled to differentially decode and re-transmit information signals, we propose a novel co-efficient vector differential distributed quasi-orthogonal space time frequency coding (DQSTFC) scheme for decode-and-forward cooperative networks. Our proposed space time frequency coding scheme relaxes the need for constant channel gain in the temporal and frequency dimensions over long symbol periods; thus, performance degradation is reduced in frequency-selective and time-selective fading environments. Simulation results illustrate the performance of our proposed co-efficient vector differential DQSTFC scheme under different channel conditions. Through pair-wise error probability analysis, we derive the full diversity design criteria for our code.

show abstract

“…CSI can be estimated through the use of some pilot symbols. For this purpose, firstly, the source transmits some pilots to the relays, and then, the relays retransmit the received signals to the destination, either one by one [12] or after performing DSTBC in the same way as on data symbols [13]. In this work, we consider the latter approach, which needs less channel‐uses to be devoted to pilot transmission.…”

Section: Introductionmentioning

confidence: 99%

Improved maximum a posteriori signal detection for amplify‐and‐forward relay networks with imperfect channel state information

et al. 2014

View full text Add to dashboard Cite

Leveraging coherent distributed space-time codes for noncoherent communication in relay networks via training

Cited by 17 publications

References 21 publications

Low complexity distributed STBCs with unitary relay matrices for any number of relays

Low complexity distributed STBCs with unitary relay matrices for any number of relays

Co-Efficient Vector Based Differential Distributed Quasi-Orthogonal Space Time Frequency Coding

Improved maximum a posteriori signal detection for amplify‐and‐forward relay networks with imperfect channel state information

Contact Info

Product

Resources

About