Abstract
A contemporary tradeoff analysis concept, recognized as throughput-reliability tradeoff (TRT) analysis, has pioneered for general block fading MIMO systems. The tribute of this analysis is its ability to reveal the reciprocity between outage probability (OP), signal-to-noise ratio (SNR) and transmission rate (R) unlike diversity-multiplexing tradeoff. The present work considers two-layer D-BLAST transmission scheme for two varieties of receiver. First, TRT analysis of D-BLAST with group detection receiver is investigated where each contented diagonal of D-BLAST is detected at once. Later, TRT analysis of D-BLAST with successive interference cancellation receiver detecting a symbol at once is investigated. Based on the derived expressions, the interplay between SNR, R and OP are explored. We verify theoretically derived expressions through simulation using MATLAB programs.
Similar content being viewed by others
References
Alamouti, S. (1998). A simple transmit diversity technique for wireless communications. Selected Areas in Communications, IEEE Journal on, 16(8), 1451–1458.
Ariyavisitakul, S. L., & Home Wireless Network, et al. (2000). Turbo space-time processing to improve wireless channel capacity. Communications, IEEE Transactions on, 48(8), 1347–1359.
Ariyavisitakul, S. L., Winters, J. H., & Lee, I. (1999). Optimum space-time processors with dispersive interference: Unified analysis and required filter span. Communications, IEEE Transactions on, 47(7), 1073–1083.
Azarian, K., & El-Gamal, H. (2007). The throughput-reliability tradeoff in block-fading mimo channels. Information Theory, IEEE Transactions on, 53(2), 488–501.
Azarian, K. (2006). Outage limited cooperative channels: Protocols and analysis. PhD thesis, The Ohio State University.
Biglieri, E., Hong, Y., & Viterbo, E. (2009). On fast-decodable space-time block codes. Information Theory, IEEE Transactions on, 55(2), 524–530.
Blomer, J., & Jindal, N. (2009). Transmission capacity of wireless ad hoc networks: Successive interference cancellation vs. joint detection. In IEEE international conference on communications, 2009. ICC ’09 (pp. 1–5).
Dai, X. (2010). Successive interference cancellation amenable space-time codes with good multiplexing-diversity tradeoffs. Wireless Personal Communications, 55(4), 645–654.
El Falou, A., Hamouda, W., Langlais, C., Nour, C. A., & Douillard, C. (2013). Finite-snr diversity-multiplexing tradeoff for rayleigh mimo channels. Communications Letters, IEEE, 17(4), 753–756.
Foschini, G. J. (1996). Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas. Bell Labs Technical Journal, 1(2), 41–59.
Guo, X., & Xia, X.-G. (2009). On full diversity space-time block codes with partial interference cancellation group decoding. Information Theory, IEEE Transactions on, 55(10), 4366–4385.
Li, J., & Chen, W. (2009). Throughput-reliability tradeoff in decode-and-forward cooperative relay channels: A network information theory approach. Communications and Networks, Journal of, 11(5), 445–454.
Li, J., Chen, W., Nosratinia, A., & Yuan, J. (2013). On the throughput-reliability tradeoff for amplify-and-forward cooperative systems. Communications, IEEE Transactions on, 61(4), 1290–1303.
Lu, Y., Zhang, W., & Xia, X.-G. (2012). On diversity and multiplexing tradeoff of two-layer D-BLAST with group zero-forcing detection. Communications, IEEE Transactions on, 60(8), 2255–2264.
Monzingo, R. A., & Miller, T. W. (1980). Introduction to adaptive arrays. Raleigh: SciTech Publishing.
Muirhead, R. J. (2009). Aspects of multivariate statistical theory (Vol. 197). New York: Wiley.
Natarajan, L. P., & Rajan, B. S. (2011). Collocated and distributed stbcs with partial interference cancellation decoding, part II: Code construction. Wireless Communications, IEEE Transactions on, 10(9), 3042–3052.
Prasad, N., & Varanasi, M. K. (2001). Optimum efficiently decodable layered space-time block codes. In Conference record of the thirty-fifth Asilomar conference on signals, systems and computers, 2001 (Vol. 1, pp. 227–231). IEEE.
Rajashekar, R., Hari, K. V. S., & Hanzo, L. (2013). A reduced-complexity partial-interference-cancellation group decoder for stbcs. Signal Processing Letters, IEEE, 20(10), 929–932.
Sellathurai, M., & Haykin, S. (2009). Space-time layered information processing for wireless communications (Vol. 30). New York: Wiley.
Shi, L., Zhang, W., & Xia, X.-G. (2011). High-rate and full-diversity space-time block codes with low complexity partial interference cancellation group decoding. Communications, IEEE Transactions on, 59(5), 1201–1207.
Siam, M. Z., & Krunz, M. (2009). Channel access scheme for mimo-enabled ad hoc networks with adaptive diversity/multiplexing gains. Mobile Networks and Applications, 14(4), 433–450.
Tarokh, V., Naguib, A., Seshadri, N., & Calderbank, A. R. (1999). Combined array processing and space-time coding. Information Theory, IEEE Transactions on, 45(4), 1121–1128.
Tarokh, V., Seshadri, N., & Calderbank, A. R. (1998). Space-time codes for high data rate wireless communication: Performance criterion and code construction. Information Theory, IEEE Transactions on, 44(2), 744–765.
Tse, D. N. C., Viswanath, P., & Zheng, L. (2004). Diversity-multiplexing tradeoff in multiple-access channels. Information Theory, IEEE Transactions on, 50(9), 1859–1874.
Tulino, A. M., & Verdú, S. (2004). Random matrix theory and wireless communications. Communications and Information theory, 1(1), 1–182.
Varanasi, M. K. (1995). Group detection for synchronous gaussian code-division multiple-access channels. Information Theory, IEEE Transactions on, 41(4), 1083–1096.
Zhang, W., Tianyi, X., & Xia, X.-G. (2012). Two designs of space-time block codes achieving full diversity with partial interference cancellation group decoding. Information Theory, IEEE Transactions on, 58(2), 747–764.
Zheng, L., & Tse, D. N. C. (2003). Diversity and multiplexing: A fundamental tradeoff in multiple-antenna channels. Information Theory, IEEE Transactions on, 49(5), 1073–1096.
Author information
Authors and Affiliations
Corresponding author
Appendices
Appendix 1: Proof of Lemma 2
The pdf \(p(\mathbf{\lambda })\) is \(K_0 e^{- \mathop { \sum } \limits _{k=1}^{M} \lambda _k} {\lambda _1}^{N - 1} \mathop {\prod } \limits _{k=2}^{M} {\lambda _k}^{M -2}\). By the definition of \(\mu\), we have \(\mathbf{\lambda }= (2^{\mathbf{\mu } R}-1)/\rho\). The derivative \(\frac{{d\mathbf{\lambda }}}{{d\mathbf{\mu }}}\) is \(\frac{R}{\rho } [\ln (2)] 2^{\mathbf{\mu } R}\). Using the change of variable the pdf \(p (\mathbf{\mu })\) through \(p( \mathbf{\lambda })\) is equal to \(p( \mathbf{\mu })\frac{{d\mathbf{\lambda }}}{{d\mathbf{\mu }}}\). Implementing this step, we will then have \(p(\mathbf{\mu }) = {K_0}\frac{{{R^{{M}}}}}{{{\rho ^{{M}}}}}{\left[ {\ln \left( 2 \right) } \right] ^{{M}}} {e^{ - \mathop {\sum }\limits _{k = 1}^{{M}} ( {\frac{{{2^{{\mu _{_k}}R}} - 1}}{\rho }} )}} {2^{\mathop {\sum } \limits _{k = 1}^{{M}} {\mu _k}R}}{\left( {\frac{{{2^{{\mu _1}R}} - 1}}{\rho }} \right) ^{{M} - 1}} \mathop {\prod }\limits _{k = 2}^{{M}} {\left( {\frac{{{2^{{\mu _k}R}} - 1}}{\rho }} \right) ^{{N} - 2}}\). Further, after simplification this equation can be written as given in Lemma 2.
Appendix 2: Proof of Theorem 1
In order to prove Eq. (22), first we have to derive
and equate it for the values of g(k) by the outage probability inequalities of Eq. (7). By looking at Eqs. (7) and (19) the lower and upper bounds formulted are given following two subsections. For the analysis purpose let all the eigenvalues of Eq. (19) are ordered and represented as \(\lambda _1 \le \lambda _2 \le \cdots \le \lambda _{M}\). Their probability density function (pdf) of \((\lambda _1,\lambda _2,\ldots ,\lambda _{M})\) is given by Eq. (20). The TRT of D-BLAST with GD is derived through the following subsections lower and upper bound.
1. Lower Bound Following Eq. (7), the lower bound of the outage probability is
Let us introduce a variable related to the channel coefficients and the transmission rate,
where \(k=1,2,\ldots ,M\). In addition, since the eigenvalues are considered in order, the values of \(\beta _k\) are also ordered, given as
When \(\beta _k\) is substituted for \(\lambda _k\) then pdf \(p(\lambda _1,\lambda _2,\ldots ,\lambda _{M})\) is then written in terms of \(\beta _k\) using Lemma 2. The resultant equation is multiplied with \(2^{c(k) \times R}\) to have,
where \(K=K_0 [\ln (2)]^{M} / \rho ^{M}\) and \(K_0\) is an normalizing factor. We now lookup for a subset region \({{\mathcal {B}}_{\varepsilon _1}} \subset {\mathcal {B}}\) such that
where \(\beta _{\max }=\max \lbrace \beta _1, \beta _2, \ldots , \beta _{M} \rbrace\). The Eq. (46) is valid for regardless of the choice for c(k), so we consider c(k) as an arbitrary function. We will then have
Assigning \({\beta _1}{N} + \left( {{N} - 1} \right) \mathop {\sum }\limits _{k = 2}^{{M}} {\beta _k} = f\left( {{\beta _1},{\beta _2}, \ldots ,{\beta _{{M}}}} \right)\) will lead us to have compressed equation
Now, we define \(f(\beta ^{\sup })\) as
Because of continuity of f, for some \(\varepsilon _1 > 0\), there exist a neighborhood \({\mathcal {I}}_{\varepsilon _2} \subset {\mathcal {B}}\), in which \(f\left( {{\beta _1}, \ldots ,{\beta _{{M}}}} \right) \ge f\left( {{\beta _{{ \varepsilon _1}}}} \right) - { \varepsilon _2}\). So in the intersection region \({\mathcal {I}}_{\varepsilon _2} \cap {\mathcal {B}}_{\varepsilon _1}\) we will have
where \(Q= Ke^{({\frac{1}{\rho }-2^{-\varepsilon _1 R}})} {(1-2^{-\varepsilon _1 R})}^{MN-2M+N-1} 2^{-\varepsilon _2 R} R^{M} Vol \lbrace {\mathcal {B}}_{\varepsilon _1} \cap {\mathcal {I}}_{\varepsilon _2} \rbrace\) is a constant and \(\mathrm{Vol} \lbrace {\mathcal {B}}_{\varepsilon _1} \cap {\mathcal {I}}_{\varepsilon _2} \rbrace = \int \limits _{{\mathcal {B}}_{\varepsilon _1} \cap {\mathcal {I}}_{\varepsilon _2}} d\beta _1 d\beta _2 \ldots d\beta _{M}\). To obtain \(f(\beta ^{\sup })\) we have to partition the operating region accordingly by \(\frac{\log \rho }{R}\) under the constraint \({\mathcal {B}}_{\varepsilon _1}\). Then the operating region \({\mathcal {R}}_\delta (k)\) for integer k values and \(\delta \ge \varepsilon _1\) an arbitrary positive constant is defined as
It is now required to determine the function \(f(\beta ^{\sup })\) in different operating regions, whereas in this work we have three operating regions. When the system is operating in \({\mathcal {R}}_\delta (0)\) region, we have
whose supremum happens at \(\beta = (0,\ldots ,\frac{T}{2})\) where \(T=M + 1\). The second case is when the system is operating in \({\mathcal {R}}_\delta (k)\) region, we then have
where the supremum happens at
Finally, the operating region is in \({\mathcal {R}}_\delta (k)\) where \(k=M\), whose supremum happens at
for which the \(f(\beta ^{\sup })\) value is
By letting the function \(f(\beta ^{\sup })\) in different operating regions with assumption \(\varepsilon \le \delta\) guarantees that \(\frac{{{M} + 1}}{2} - k\left( {\frac{{\log \rho }}{R} + \varepsilon } \right) > 0\) and as \({\mathcal {R}}(k)\) shown in (23). We will then have
2. Upper Bound We now turn our interest towards upper bound of the outage probability, given as
by Eq. (7). We will now consider for change of variable and redefine for \(\log \left( {1 + \rho {\lambda _k}} \right) /R = {\beta _k}\), where \(k = 1,2, \ldots ,{M}.\) The \({\beta _k}\)s are ordered as like the eigenvalues, given by,
Using Lemma 2, the pdf of \({\lambda _1} \le {\lambda _2} \le \cdots \le {\lambda _{{M}}}\) is written in terms of \(\beta\) and substituted for outage probability after multiplying with \({2^{ - c\left( k \right) R}}\) gives
where \({{K = {K_0}{{\left[ {\ln \left( 2 \right) } \right] }^{{M}}}}/ {{\rho ^{{M}}}}}\). Considering \(c\left( k \right)\) as an arbitrary function at this point of time, we write this inequality as \({P_{otg}}{2^{ - c\left( k \right) R}} \le B{}_1 + {B_2}\). The functions \(B{}_1\) and \(B{}_2\) are the subsets of outage probability that are defined as,
where the outage region which is the limit of integration is then defined as
With the defined subsets we will have
Solving for \(B_1\) and \(B_2\) individually and later substituting in the Eq. (63) yields the result. Now considering \(B_1\) for the specified region \({\mathcal {B}}_1\), we get
where \(f \left( {{\beta _1},{\beta _2}, \ldots ,{\beta _M}} \right)\) redefined as \(( N \beta _1 + (N-1) \sum \limits _{k=2}^M \beta _k ).\) Realizing that \({{\mathcal {B}}_1}\) is a subset of \({B_1}\) which belongs to \(\left\{ {\beta |1 \ge {\beta _k} \ge 0,\forall k} \right\}\) and hence \(Vol\left\{ {{{\mathcal {B}}_1}} \right\} \le 1.\) This leads to the result
where \(f\left( {{{\mathcal {B}}_1}^{\sup }} \right)\) is defined as
Now, we have to look at other subset \({B_2}\) of the Eq. (63) for
is given by,
For the function given in Eq. (67), there exists a supremum value, defined as,
Then for any \(\varepsilon _4>0\), there exists a neighborhood \(I_{\varepsilon _4}\) belongs to \(\beta ^{\sup }\) such that,
This condition let us to write
From Eqs. (64) and (71) we will have
This means that
because the value \(2^{\varepsilon R}\) decays exponentially in right-hand side while it grows polynomially with the same variable in Eq. (72). For the second term in Eq. (63), we note that
is the supremum of \(\frac{\log B_2}{\log \rho }\) in the region \({\mathcal {B}}_{\varepsilon _3}\). We will have
where \(f(\beta ^{\sup })\) redefined as
To obtain value for Eq. (92) we have to let \(f(\beta ^{\sup })\) in three operating regions as mentioned earlier, thus we get
The Eqs. (56), (57), (77), and (78) are TRT expressions that belong to the operating region given in Eq. (23) for the D-BLAST transmission employing GD at the receiver and completes the proof.
Appendix 3: Proof of Lemma 3
After simplification the proof required can be written as,
Now
where \(\mathbf{g}_i\) is the ith column of matrix \(\mathbf{H}\). For single transmit and N receive antennas, it can be written that
Assuming it is true for \(M-1\) transmitting antennas, we can write
From Eqs. (80) and (81), we have
where \(\mathbf{P} \,\triangleq\, \varOmega _M\) and \(\mathbf{Q} \,\triangleq\, \varOmega _{M-1}\). By applying the matrix inversion lemma given in [3], we can write
The matrix inverse \(\mathbf{P}^{-1}\) is
where \(\mathbf{P}_{adj}\) is the adjoint of matrix \(\mathbf{P}\); thus, we can write Eq. (85) as
where (86) is obtained through exchanging \(\det \mathbf{Q}\) using (81). To prove Eq. (79), we need to show that
Expanding Eq. (83), we will have
where \(\mathbf{q}_i , \forall i\) is the ith column of \(\mathbf{Q}\) and \(H_{ij}\) is the ijth element of matrix \(\mathbf{H}\). The Eq. (87) can be proved by showing that jth element of \(\mathbf{P}_{adj}{} \mathbf{g}_m\) is equal to the jth element of \(\mathbf{Q}_{adj}{} \mathbf{g}_j\) for \(j= 1,\ldots ,M\). The jth element of \(\mathbf{P}_{adj}{} \mathbf{g}_m\) is given by \(det \left( \mathbf{P}_j \right)\), where \(\mathbf{P}_j\) is obtained by replacing the jth column of matrix \(\mathbf{P}\) by \(\mathbf{g}_m\). Similarly, the jth element of \(\mathbf{Q}_{adj}{} \mathbf{g}_m\) is given by \(det \left( \mathbf{Q}_j \right)\). Accordingly, by replacing the jth column by \(\mathbf{g}_m\), we get
By the fact that the determinant of a matrix will not change if a column is multiplied by a constant is added to another column, we can write the above equation as
Similarly, we can show that \(det \left( \mathbf{P}_j \right) = det \left( \mathbf{Q}_j \right)\) for \(i= 1,2, \ldots , N, i = j\). This completes the proof.
Appendix 4: Proof of Theorem 2
In order to prove Eq. (37), first we have to derive
and equate it for the values of g(k) by the outage probability inequalities of Eq. (7). By looking at Eqs. (7) and (35) the lower and upper bounds formulted are given following two subsections. For the analysis purpose let all the eigenvalues of Eq. (35) are ordered and represented as \(\lambda _1 \le \lambda _2 \le \cdots \le \lambda _{M}\). Their probability density function (pdf) of \((\lambda _1,\lambda _2,\ldots ,\lambda _{M})\) is given by Eq. (36). The TRT of D-BLAST with SIC is derived through the following subsections lower and upper bound.
1. Lower Bound Following Eq. (7), the lower bound of the outage probability is
Let us introduce a variable related to the channel coefficients and the the transmission rate,
where \(k=1,2,\ldots ,M\). In addition, since the eigenvalues are considered in order, the values of \(\beta _k\) are also ordered, given as
When \(\beta _k\) is substituted for \(\lambda _k\) then pdf \(p(\lambda _1,\lambda _2,\ldots ,\lambda _{M})\) is then written in terms of \(\beta _k\) using Lemma 4. The resultant equation is multiplied with \(2^{c(k) \times R}\) to have,
where \(K_0\) is an normalizing factor. We now lookup for a subset region \({{\mathcal {B}}_{\varepsilon _1}} \subset {\mathcal {B}}\) such that
The Eq. (95) is valid for regardless of the choice for c(k), so we consider c(k) as an arbitrary function. We will then have
Realizing that \(e^{-2^{-\varepsilon _1 R}} \ge \left( 1 - 2^{- \varepsilon _1 R} \right)\) and assigning \(f \left( \beta \right) \,\triangleq\, \sum \limits _{i=1}^q \left( \left| M-N \right| + 2i -1 \right) \beta _i\) will lead us to have
Now, we redefine
Because of continuity of f, for some \(\varepsilon _1 > 0\), there exist a neighborhood \({\mathcal {I}}_{\varepsilon _2} \subset {\mathcal {B}}\), in which \(f\left( {{\beta _1}, \cdots ,{\beta _{{M}}}} \right) \ge f\left( \beta \right) - { \varepsilon _2}\). So in the intersection region \({\mathcal {I}}_{\varepsilon _2} \cap {\mathcal {B}}_{\varepsilon _1}\) we will have
where \(Q= {K} M^{MN} R^q e^{\frac{Mq}{\rho }} \left( 1-2^{-\varepsilon _1 R} \right) ^{q(q \left| M-N \right| + q(q-1))+Mq} 2^{\left( -\varepsilon _2\right) } \mathrm{Vol} \left\{ {\mathcal {A}}_{\varepsilon _1} \cap I_{\varepsilon _2} \right\}\) is a constant and \(\mathrm{Vol} \lbrace {\mathcal {B}}_{\varepsilon _1} \cap {\mathcal {I}}_{\varepsilon _2} \rbrace = \int \limits _{{\mathcal {B}}_{\varepsilon _1} \cap {\mathcal {I}}_{\varepsilon _2}} d\beta\). To obtain \(f(\beta ^{\sup })\) we have to partition the operating region accordingly by \(\frac{\log \rho }{R}\) under the constraint \({\mathcal {B}}_{\varepsilon _1}\). Then the operating region \({\mathcal {R}}_\delta (k)\) for integer k values and \(\delta \ge \varepsilon _1\) an arbitrary positive constant is defined as
It is now required to determine the function \(f(\beta ^{\sup })\) in different operating regions, whereas in this work we have three operating regions. When the system is operating in \({\mathcal {R}}_\delta (0)\) region, we have
whose supremum happens at \(\beta = (0,\ldots ,\frac{T}{2})\) where \(T=M + 1\). The second case is when the system is operating in \({\mathcal {R}}_\delta (k)\) region, we then have
where the supremum happens at
Finally, the operating region is in \({\mathcal {R}}_\delta (k)\) where \(k=M\), whose supremum happens at
for which the \(f(\beta ^{\sup })\) value is
By letting the function \(f(\beta ^{\sup })\) in different operating regions with assumption \(\varepsilon \le \delta\) guarantees that \(\frac{{{M} + 1}}{2} - k\left( {\frac{{\log \rho }}{R} + \varepsilon } \right) > 0\) and as \({\mathcal {R}}(k)\) shown in (38). We will then have
2. Upper Bound We now turn our interest towards upper bound of the outage probability, given as
We will now consider for change of variable and redefine for \(\log \left( {1 + \frac{\rho }{M} {\lambda _k}} \right) /R = {\beta _k}\), where \(k = 1,2, \ldots ,{q}\). The \({\beta _k}\)s are ordered as like the eigenvalues, given by,
Using Lemma 4, the pdf of \({\lambda _1} \le {\lambda _2} \le \cdots \le {\lambda _{{q}}}\) is written in terms of \(\beta\) and substituted for outage probability after multiplying with \({2^{ - c\left( k \right) R}}\) gives
Considering \(c\left( k \right)\) as an arbitrary function at this point of time, we write this inequality as \({P_{otg}}{2^{ - c\left( k \right) R}} \le B{}_1 + {B_2}\). The functions \(B{}_1\) and \(B{}_2\) are the subsets of outage probability that are defined as,
where the outage region which is the limit of integration is then defined as
With the defined subsets we will have
Solving for \(B_1\) and \(B_2\) individually and later substituting in the Eq. (110) yields the result. Now considering \(B_1\) for the specified region \({\mathcal {B}}_1\), we get
where \(f \left( {{\beta _1},{\beta _2}, \ldots ,{\beta _M}} \right)\) redefined as \(( N \beta _1 + (N-1) \sum \limits _{k=2}^M \beta _k ).\) Realizing that \({{\mathcal {B}}_1}\) is a subset of \({B_1}\) which belongs to \(\left\{ {\beta |1 \ge {\beta _k} \ge 0,\forall k} \right\}\) and hence \(Vol\left\{ {{{\mathcal {B}}_1}} \right\} \le 1.\) This leads to the result
where \(f\left( {{{\mathcal {B}}_1}^{\sup }} \right)\) is defined as
Now, we have to look at other subset \({B_2}\) of the Eq. (110) for
and realizing that \(e^{-2^{-\varepsilon _1 R}} \ge \left( 1 - 2^{-\varepsilon _1 R} \right)\) to have the expression,
For the function given in Eq. (114), there exists a supremum value, defined as,
Then for any \(\varepsilon _4>0\), there exists a neighborhood \(I_{\varepsilon _4}\) belongs to \(\beta ^{\sup }\) such that,
This condition let us to write
From Eqs. (111) and (118) and the fact that \(e^{-\frac{M(q-1)}{\rho }} \le 1\) we will have
This means that
because the value \(2^{\varepsilon R}\) decays exponentially in right-hand side while it grows polynomially with the same variable in Eq. (119). For the second term in Eq. (110), we note that
is the supremum of \(\frac{\log B_2}{\log \rho }\) in the region \({\mathcal {B}}_{\varepsilon _3}\). We will have
where \(f(\beta ^{\sup })\) redefined as
To obtain supremum value for Eq. (105) we have to let \(f(\beta ^{\sup })\) in three operating regions as mentioned earlier, thus we get
The Eqs. (104) and (124) are TRT expressions that belong to the operating region given in Eq. (23) for the D-BLAST transmission employing SIC at the receiver and completes the proof.
Rights and permissions
About this article
Cite this article
Sundaramurthi, R., Chaturvedi, S.K. On Throughput-Reliability Tradeoff of Two-Layer D-BLAST Transmission Scheme. Wireless Pers Commun 90, 339–367 (2016). https://doi.org/10.1007/s11277-016-3372-z
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11277-016-3372-z