|
Main.PAPR History
Hide minor edits - Show changes to markup
March 09, 2010, at 04:22 AM
by ggne0015 -
October 07, 2009, at 03:05 AM
by ggne0015 -
October 07, 2009, at 03:00 AM
by ggne0015 -
Changed line 60 from:
where f_o is the output carrier frequency and f_s is the frequency offset for the sth sub-carrier. In other words, we can write the PAPR as the max of the polynomial {cp}_0 + {cp}_1z + {cp}_2 z^2 \ldots + {cp}_{N-1} z^{N-1} where z = exp(2 \pi j t) and {cp}_k = c_k exp( 2 \pi \psi t) . In other words, to compute the PAPR, we must find that vector Z = \{ 1, z, z^2, \ldots\} for a given C = {c_0, c_1 , c_2, \ldots} that maximizes the inner product CZ^T. Tarokh and Jafarkhani suggest various methods to compute this, including a trellis coding technique. See [Tarokh] for more details
to:
where f_o is the output carrier frequency and f_s is the frequency offset for the sth sub-carrier. In other words, we can write the PAPR as the max of the polynomial {cp}_0 + {cp}_1z + {cp}_2 z^2 \ldots + {cp}_{N-1} z^{N-1} where z = exp(2 \pi j t) and {cp}_k = c_k exp( 2 \pi \psi t) . To compute PAPR we must find that vector Z = \{ 1, z, z^2, \ldots\} for a given C = {c_0, c_1 , c_2, \ldots} that maximizes the inner product CZ^T. Tarokh and Jafarkhani suggest various methods to compute this, including a trellis coding technique. See [Tarokh] for more details
October 07, 2009, at 02:58 AM
by ggne0015 -
Changed lines 38-42 from:
PAPR(C) = \sum_{k=0}^{N-1} \beta_k \cos(2 \pi k t)
to:
\begin{eqnarray}
PAPR(C) = \sum_{k=0}^{N-1} \beta_k \cos(2 \pi k t) \beta_0 = 1 \beta_k = \frac{2}{N} \sum_{m=0}^{N-1-k} c_m c_{m+k}
\end{eqnarray}
Changed lines 44-46 from:
where \beta_0 is 1 and \beta_k is given by \frac{2}{N} \sum_{m=0}^{N-1-k} c_m c_{m+k} where k > 0. This is subsequently maximized by standard numerical techniques.
to:
This is subsequently maximized by standard numerical techniques.
Changed lines 49-60 from:
Tarokh and Jafarkhani propose a technique for the analysis of a signal comprising of N symbols from a constellation C. Their analysis follows from the fact that that the expression for PAPR given above can be re-written as Īnter% Attach:papr6.png Δ, where f_o is the output carrier frequency and f_s is the frequency offset for the sth sub-carrier. Noting that f_o >> f_s , we set \psi = f_o / f_s and get Attach:papr7.png Δ. In other words, we can write the PAPR as the max of the polynomial {cp}_0 + {cp}_1z + {cp}_2 z^2 \ldots + {cp}_{N-1} z^{N-1} where z = exp(2 \pi j t) and {cp}_k = c_k exp( 2 \pi \psi t) . In other words, to compute the PAPR, we must find that vector Z = \{ 1, z, z^2, \ldots\} for a given C = {c_0, c_1 , c_2, \ldots} that maximizes the inner product CZ^T. Tarokh and Jafarkhani suggest various methods to compute this, including a trellis coding technique. See [Tarokh] for more details
to:
Tarokh and Jafarkhani propose a technique for the analysis of a signal comprising of N symbols from a constellation C. Their analysis follows from the fact that that the expression for PAPR given above can be re-written as
\begin{eqnarray}
PAPR(C) &=& \max_{0 \le t \le 1} \frac{S(c,t)^2}{P_{avg}} \\
&=& \max_{0 \le t \le 1} \frac{\Re \left(\sum_{k=0}^{N-1} c_i exp\{-2\pi j(f_0 + i f_s) t\} \right)^2}{P_{avg}} \\
&=& \max_{0 \le t \le 1} \frac{\Re \left(\sum_{k=0}^{N-1} c_i exp\{-2\pi j(\psi + i) t\} \right)^2}{P_{avg}} \\
\psi = \frac{f_o}{f_s} \\
f_0 >> f_s
\end{eqnarray}
where f_o is the output carrier frequency and f_s is the frequency offset for the sth sub-carrier. In other words, we can write the PAPR as the max of the polynomial {cp}_0 + {cp}_1z + {cp}_2 z^2 \ldots + {cp}_{N-1} z^{N-1} where z = exp(2 \pi j t) and {cp}_k = c_k exp( 2 \pi \psi t) . In other words, to compute the PAPR, we must find that vector Z = \{ 1, z, z^2, \ldots\} for a given C = {c_0, c_1 , c_2, \ldots} that maximizes the inner product CZ^T. Tarokh and Jafarkhani suggest various methods to compute this, including a trellis coding technique. See [Tarokh] for more details
October 07, 2009, at 02:49 AM
by ggne0015 -
Changed line 29 from:
g(S=s_0,s_1,\ldots,) = \max_{0 \le t \le T_s} \frac{ \Re \left[\sum_{k=0}^{N-1} s_i exp\{-i 2\pi k f_s t\} \right]^2}{P_avg} \\
to:
g(S=s_0,s_1,\ldots,) = \max_{0 \le t \le T_s} \frac{ \Re \left[\sum_{k=0}^{N-1} s_i exp\{-i 2\pi k f_s t\} \right]^2}{P_{avg}} \\
Changed lines 36-40 from:
A simple approach was used by [Tellambura] where it is assumed that the complex constellation is a BPSK modulation. Tellambura shows that the PAPR can then be written as Īnter% Attach:papr8.png Δ where β_0_ is 1 and β_k_ is given by Īnter% Attach:papr9.png Δ where k > 0. This is subsequently maximized by standard numerical techniques.
to:
A simple approach was used by [Tellambura] where it is assumed that the complex constellation is a BPSK modulation. Tellambura shows that the PAPR can then be written as
PAPR(C) = \sum_{k=0}^{N-1} \beta_k \cos(2 \pi k t)
where \beta_0 is 1 and \beta_k is given by \frac{2}{N} \sum_{m=0}^{N-1-k} c_m c_{m+k} where k > 0. This is subsequently maximized by standard numerical techniques.
October 07, 2009, at 02:46 AM
by ggne0015 -
Changed line 29 from:
g(S=s_0,s_1,\ldots,) = \max_{0 \le t \le T_s} \Re \left[ \frac{\sum_{k=0}^{N-1} s_i exp\{-i 2\pi k f_s t\} \right]^2}{P_avg} \\
to:
g(S=s_0,s_1,\ldots,) = \max_{0 \le t \le T_s} \frac{ \Re \left[\sum_{k=0}^{N-1} s_i exp\{-i 2\pi k f_s t\} \right]^2}{P_avg} \\
October 07, 2009, at 02:44 AM
by ggne0015 -
Changed lines 26-34 from:
To estimate PAPR, one can take all the possible code words, compute the PAPR for a given code word using the formula above and then take the expectation of this. i.e. Attach:papr4.png Δ, where Σ is the constellation of available output symbol words corresponding to all possible input code words C. However, this will require an exhaustive search of all possible code words; for block codes? with large N or for trellis codes?, this could be computationally impossible.
to:
To estimate PAPR, one can take all the possible code words, compute the PAPR for a given code word using the formula above and then take the expectation of this. i.e.
\begin{eqnarray}
g(S=s_0,s_1,\ldots,) = \max_{0 \le t \le T_s} \Re \left[ \frac{\sum_{k=0}^{N-1} s_i exp\{-i 2\pi k f_s t\} \right]^2}{P_avg} \\
g(\Sigma) = \sum_{s \in \sigma} g(S)P(S)
\end{eqnarray}
where \Sigma is the constellation of available output symbol words corresponding to all possible input code words C. However, this will require an exhaustive search of all possible code words; for block codes? with large N or for trellis codes?, this could be computationally impossible.
October 07, 2009, at 02:32 AM
by ggne0015 -
Changed lines 12-14 from:
Consider a signal which is comprised of N sub-carriers at a spacing f_c. Each tone contains a complex symbol s_j. The composite signal is the array of complex symbols S = s_0,s_1 \ldots s_{N-1} , which are generated by modulating the input block C = \{c_0,c_1 \ldots c_{M-1}\}. This signal is transmitted over a time symbol of duration T_s. The complex signal envelope (prior to modulating on the carrier is given by \Re \sum_{k=0}^{N-1} s_i exp(-i2\pi k f_s t) . The peak to average power ratio is then given by \max_{0 \le t \le T_s} \Re \sum_{k=0}^{N-1} s_i exp(-i2\pi k f_s t)/P_{avg} .
to:
Consider a signal which is comprised of N sub-carriers at a spacing f_c. Each tone contains a complex symbol s_j. The composite signal is the array of complex symbols S = s_0,s_1 \ldots s_{N-1} , which are generated by modulating the input block C = \{c_0,c_1 \ldots c_{M-1}\}. This signal is transmitted over a time symbol of duration T_s. The complex signal envelope (prior to modulating on the carrier is given by \Re \sum_{k=0}^{N-1} s_i exp(-i2\pi k f_s t) .
The peak to average power ratio is then given by \max_{0 \le t \le T_s} \Re \sum_{k=0}^{N-1} s_i exp(-i2\pi k f_s t)/P_{avg} .
October 07, 2009, at 02:32 AM
by ggne0015 -
Changed line 12 from:
Consider a signal which is comprised of N sub-carriers at a spacing f_c. Each tone contains a complex symbol s_j. The composite signal is the array of complex symbols S = s_0,s_1 \ldots s_{N-1} , which are generated by modulating the input block C = \{c_0,c_1 \ldots c_{M-1}\}. This signal is transmitted over a time symbol of duration T_s. The complex signal envelope (prior to modulating on the carrier is given by \mathcal{R} \sum_{k=0}^{N-1} s_i exp(-i2\pi k f_s t) . The peak to average power ratio is then given by \max_{0 \le t \le T_s} \mathcal{R} \sum_{k=0}^{N-1} s_i exp(-i2\pi k f_s t)/P_{avg} .
to:
Consider a signal which is comprised of N sub-carriers at a spacing f_c. Each tone contains a complex symbol s_j. The composite signal is the array of complex symbols S = s_0,s_1 \ldots s_{N-1} , which are generated by modulating the input block C = \{c_0,c_1 \ldots c_{M-1}\}. This signal is transmitted over a time symbol of duration T_s. The complex signal envelope (prior to modulating on the carrier is given by \Re \sum_{k=0}^{N-1} s_i exp(-i2\pi k f_s t) . The peak to average power ratio is then given by \max_{0 \le t \le T_s} \Re \sum_{k=0}^{N-1} s_i exp(-i2\pi k f_s t)/P_{avg} .
October 06, 2009, at 09:51 AM
by ggne0015 -
Changed line 62 from:
P = {e^j2πl/c^, l = 0,1,...c-1}. This also means that the side-information to be transmitted about the phase shifts used is limited to c log(l). For l=0, there is no shift. One technique, called iterative flipping , works as follows
to:
P = e^{j2\pi l/c}, l = 0,1,\ldots,c-1 . This also means that the side-information to be transmitted about the phase shifts used is limited to c \log(l). For l=0, there is no shift. One technique, called iterative flipping , works as follows
October 06, 2009, at 09:41 AM
by ggne0015 -
Changed line 70 from:
An alternative to this method, known as Selective Mapping is to construct K different phase shift vectors \Psi_m = \{ {\psi^0}_m_,{\psi^1}_m, \ldots \psi^{M-1}_m\} . For each input block of N symbols, we generate K candidate blocks by multiplying the input block with the k possible sets of phase shifts \phi_k. The output block S {\phi_k}^{*T} with the least PAPR is transmitted. Here k^{*} is the index of the optimal phase shift vector for this particular input block.
to:
An alternative to this method, known as Selective Mapping is to construct K different phase shift vectors \Psi_m = \{ {\psi^0}_m,{\psi^1}_m, \ldots \psi^{M-1}_m\} . For each input block of N symbols, we generate K candidate blocks by multiplying the input block with the k possible sets of phase shifts \phi_k. The output block S {\phi_k}^{*T} with the least PAPR is transmitted. Here k^{*} is the index of the optimal phase shift vector for this particular input block.
October 06, 2009, at 09:41 AM
by ggne0015 -
Changed line 70 from:
An alternative to this method, known as Selective Mapping is to construct K different phase shift vectors \Psi_m = \{ {\psi^0}_m_,{\psi^1}_m, \ldots \psi^{M-1}_m\} . For each input block of N symbols, we generate K candidate blocks by multiplying the input block with the k possible sets of phase shifts \phi_k. The output block S {\phi_k}^{*T} with the least PAPR is transmitted. Here k^* is the index of the optimal phase shift vector for this particular input block.
to:
An alternative to this method, known as Selective Mapping is to construct K different phase shift vectors \Psi_m = \{ {\psi^0}_m_,{\psi^1}_m, \ldots \psi^{M-1}_m\} . For each input block of N symbols, we generate K candidate blocks by multiplying the input block with the k possible sets of phase shifts \phi_k. The output block S {\phi_k}^{*T} with the least PAPR is transmitted. Here k^{*} is the index of the optimal phase shift vector for this particular input block.
October 06, 2009, at 09:40 AM
by ggne0015 -
Changed lines 12-13 from:
Consider a signal which is comprised of N sub-carriers at a spacing f_c. Each tone contains a complex symbol s_j. The composite signal is the array of complex symbols S = s_0,s_1 \ldots s_{N-1} , which are generated by modulating the input block C = \{c_0,c_1 \ldots c_{M-1}\}. This signal is transmitted over a time symbol of duration T_s. The complex signal envelope (prior to modulating on the carrier is given by \mathcal{R} \sum_{k=0}^{N-1} s_i exp(-i2\pi k f_s t) . The peak to average power ratio is then given by \max{0 \le t \le T_s} \mathcal{R} \sum_{k=0}^{N-1} s_i exp(-i2\pi k f_s t)/P_{avg} .
to:
Consider a signal which is comprised of N sub-carriers at a spacing f_c. Each tone contains a complex symbol s_j. The composite signal is the array of complex symbols S = s_0,s_1 \ldots s_{N-1} , which are generated by modulating the input block C = \{c_0,c_1 \ldots c_{M-1}\}. This signal is transmitted over a time symbol of duration T_s. The complex signal envelope (prior to modulating on the carrier is given by \mathcal{R} \sum_{k=0}^{N-1} s_i exp(-i2\pi k f_s t) . The peak to average power ratio is then given by \max_{0 \le t \le T_s} \mathcal{R} \sum_{k=0}^{N-1} s_i exp(-i2\pi k f_s t)/P_{avg} .
Changed lines 65-71 from:
- Fix the first value b_0_ to 1, and then search for optimal setting for the second value b_1_, which yields the lowest PAPR.
- After finding the optimal value of b_1_, fix it and go on to b_1_
For c=2, the second term is obtained by flipping the sign of the first term, hence the term iterative flipping. This method is a heuristic search and obviously does not give the global optimum. Han and Lee have suggested an improvement where instead of changing just one index at one time, they search for the optimum out of all possible vectors with upto r changes from the current one i.e. a Hamming Distance of r.
An alternative to this method, known as Selective Mapping is to construct K different phase shift vectors Φ_m_ = { φ^0^_m_,φ^1^_m_,...φ^M-1^_m_}. For each input block of N symbols, we generate K candidate blocks by multiplying the input block with the k possible sets of phase shifts Φ_k_. The output block SΦ_k^*^_^T^ with the least PAPR is transmitted. Here k^*^ is the index of the optimal phase shift vector for this particular input block.
to:
- Fix the first value b_0 to 1, and then search for optimal setting for the second value b_1, which yields the lowest PAPR.
- After finding the optimal value of b_1, fix it and go on to b_2
For c=2, the second term is obtained by flipping the sign of the first term, hence the term iterative flipping. This method is a heuristic search and obviously does not give the global optimum. Han and Lee have suggested an improvement where instead of changing just one index at one time, they search for the optimum out of all possible vectors with upto r changes from the current one i.e. a Hamming Distance of r.
An alternative to this method, known as Selective Mapping is to construct K different phase shift vectors \Psi_m = \{ {\psi^0}_m_,{\psi^1}_m, \ldots \psi^{M-1}_m\} . For each input block of N symbols, we generate K candidate blocks by multiplying the input block with the k possible sets of phase shifts \phi_k. The output block S {\phi_k}^{*T} with the least PAPR is transmitted. Here k^* is the index of the optimal phase shift vector for this particular input block.
Deleted line 73:
Deleted lines 81-82:
October 06, 2009, at 08:55 AM
by ggne0015 -
Changed lines 58-60 from:
Tarokh and Jafarkhani propose a method where, instead of transmitting S, they transmit SΦ^T^ where Φ is a vector of optimally chosen phase shift angles { φ_0_,φ_1_,...φ_M-1_}. There is no direct method for computing the optimal phase shift vector Φ, however, there are iterative algorithms to compute them for different modulation techniques. Tarokh and Jafarkhani have reported results for 48 sub-carriers, which in practise is a fairly good block size for OFDM type systems. The authors demonstrate a PAPR reduction of 4.22dB for 8PSK modulation.
Phase shifting can also be done in blocks, instead of individual sub-carriers. This technique also goes by the name partial transmit sequences . In this technique, S is broken into a set of blocks, {S_0_, S_1_,...S_c-1_} of size k = S/C, and then the entire block is weighted using an optimal weight vector B={b__0_, _1_..._c-1_}. Block partitioning can be interleaved, adjacent, or psuedo-random.
to:
Tarokh and Jafarkhani propose a method where, instead of transmitting S, they transmit S \Phi^T where \Phi is a vector of optimally chosen phase shift angles \{\phi_0,\phi_1,\ldots \phi_{M-1}\} . There is no direct method for computing the optimal phase shift vector \Phi, however, there are iterative algorithms to compute them for different modulation techniques. Tarokh and Jafarkhani have reported results for 48 sub-carriers, which in practise is a fairly good block size for OFDM type systems. The authors demonstrate a PAPR reduction of 4.22dB for 8PSK modulation.
Phase shifting can also be done in blocks, instead of individual sub-carriers. This technique also goes by the name partial transmit sequences . In this technique, S is broken into a set of blocks, \{S_0, S_1,...S_{c-1}\} of size k = S/C, and then the entire block is weighted using an optimal weight vector B= \{b_0, b_1, \ldots, b_{c-1}\}. Block partitioning can be interleaved, adjacent, or psuedo-random.
October 06, 2009, at 08:52 AM
by ggne0015 -
Changed lines 12-13 from:
Consider a signal which is comprised of N sub-carriers at a spacing f_c. Each tone contains a complex symbol s_j. The composite signal is the array of complex symbols S = s_0,s_1 \ldots s_{N-1} , which are generated by modulating the input block C = \{c_0,c_1 \ldots c_{M-1}\}. This signal is transmitted over a time symbol of duration T_s. The complex signal envelope (prior to modulating on the carrier is given by \mathcal{R} \sum_{k=0}^{N-1} s_i exp(-i2\pi k f_s t) . The peak to average power ratio is then given by \frac{\mathcal{R} \sum_{k=0}^{N-1} s_i exp(-i2\pi k f_s t)}{P_{avg}} . Here P_{avg} is given by the well known formula P_{avg} = \Vert S \Vert = \sum {s_k}^2
to:
Consider a signal which is comprised of N sub-carriers at a spacing f_c. Each tone contains a complex symbol s_j. The composite signal is the array of complex symbols S = s_0,s_1 \ldots s_{N-1} , which are generated by modulating the input block C = \{c_0,c_1 \ldots c_{M-1}\}. This signal is transmitted over a time symbol of duration T_s. The complex signal envelope (prior to modulating on the carrier is given by \mathcal{R} \sum_{k=0}^{N-1} s_i exp(-i2\pi k f_s t) . The peak to average power ratio is then given by \max{0 \le t \le T_s} \mathcal{R} \sum_{k=0}^{N-1} s_i exp(-i2\pi k f_s t)/P_{avg} .
Here P_{avg} is given by the well known formula P_{avg} = \Vert S \Vert = \sum {s_k}^2
Changed lines 19-21 from:
PAPR occurs because, in a multi-carrier environment, the different sub-carriers are out of phase with each other. Thus, at each instant they are offset with respect to each other at different phase values. However, there may come a point when all of them achieve the maximum value simultaneously; this will cause the output envelope to suddenly shoot up. This causes a 'peak' in the output envelope.
to:
PAPR occurs when, in a multi-carrier environment, the different sub-carriers are out of phase with each other. Thus, at each instant they are offset with respect to each other at different phase values. However, there may come a point when all of them achieve the maximum value simultaneously; this will cause the output envelope to suddenly shoot up. This causes a 'peak' in the output envelope.
Changed lines 24-25 from:
To estimate PAPR, one can take all the possible code words, compute the PAPR for a given code word using the formula above and then take the expectation of this. i.e. Īnter% Attach:papr4.png Δ, where Σ is the constellation of available output symbol words corresponding to all possible input code words C. However, this will require an exhaustive search of all possible code words; for block codes? with large N or for trellis codes?, this could be computationally impossible.
to:
To estimate PAPR, one can take all the possible code words, compute the PAPR for a given code word using the formula above and then take the expectation of this. i.e. Attach:papr4.png Δ, where Σ is the constellation of available output symbol words corresponding to all possible input code words C. However, this will require an exhaustive search of all possible code words; for block codes? with large N or for trellis codes?, this could be computationally impossible.
Changed line 31 from:
Tarokh and Jafarkhani propose a technique for the analysis of a signal comprising of N symbols from a constellation C. Their analysis follows from the fact that that the expression for PAPR given above can be re-written as Īnter% Attach:papr6.png Δ, where f_o_ is the output carrier frequency and f_s_ is the frequency offset for the sth sub-carrier. Noting that f_o_ >> f_s_, we set ψ = f_o_ / f_s_ and get Īnter% Attach:papr7.png Δ. In other words, we can write the PAPR as the max of the polynomial cp_0_ + cp_1_.z + cp_2_z^2^ ... + cp_N-1_z^N-1^ where z = exp(2 π j t) and cp_k_ = c_k_exp( 2 π ψ t). In other words, to compute the PAPR, we must find that vector Z = { 1, z, z^2^, ...} for a given C = {c_0_, c_1_ , c_2_, ...} that maximizes the inner product CZ^T^. Tarokh and Jafarkhani suggest various methods to compute this, including a trellis coding technique. See [Tarokh] for more details
to:
Tarokh and Jafarkhani propose a technique for the analysis of a signal comprising of N symbols from a constellation C. Their analysis follows from the fact that that the expression for PAPR given above can be re-written as Īnter% Attach:papr6.png Δ, where f_o is the output carrier frequency and f_s is the frequency offset for the sth sub-carrier. Noting that f_o >> f_s , we set \psi = f_o / f_s and get Attach:papr7.png Δ. In other words, we can write the PAPR as the max of the polynomial {cp}_0 + {cp}_1z + {cp}_2 z^2 \ldots + {cp}_{N-1} z^{N-1} where z = exp(2 \pi j t) and {cp}_k = c_k exp( 2 \pi \psi t) . In other words, to compute the PAPR, we must find that vector Z = \{ 1, z, z^2, \ldots\} for a given C = {c_0, c_1 , c_2, \ldots} that maximizes the inner product CZ^T. Tarokh and Jafarkhani suggest various methods to compute this, including a trellis coding technique. See [Tarokh] for more details
October 06, 2009, at 07:54 AM
by ggne0015 -
Changed lines 12-13 from:
Consider a signal which is comprised of N sub-carriers at a spacing f_c. Each tone contains a complex symbol s_j. The composite signal is the array of complex symbols S = s_0,s_1 \ldots s_{N-1} , which are generated by modulating the input block C = \{c_0,c_1 \ldots c_{M-1}\}. This signal is transmitted over a time symbol of duration T_s. The complex signal envelope (prior to modulating on the carrier is given by Īnter% Attach:papr1.png Δ. The peak to average power ratio is then given by \mathcal{R} \sum_{k=0}^{N-1} s_i exp(-i2\pi k f_s t) . Here P_{avg} is given by the well known formula P_{avg} = \Vert S \Vert = \sum {s_k}^2
to:
Consider a signal which is comprised of N sub-carriers at a spacing f_c. Each tone contains a complex symbol s_j. The composite signal is the array of complex symbols S = s_0,s_1 \ldots s_{N-1} , which are generated by modulating the input block C = \{c_0,c_1 \ldots c_{M-1}\}. This signal is transmitted over a time symbol of duration T_s. The complex signal envelope (prior to modulating on the carrier is given by \mathcal{R} \sum_{k=0}^{N-1} s_i exp(-i2\pi k f_s t) . The peak to average power ratio is then given by \frac{\mathcal{R} \sum_{k=0}^{N-1} s_i exp(-i2\pi k f_s t)}{P_{avg}} . Here P_{avg} is given by the well known formula P_{avg} = \Vert S \Vert = \sum {s_k}^2
Changed line 15 from:
Īnter%
to:
October 06, 2009, at 07:48 AM
by ggne0015 -
Changed line 12 from:
Consider a signal which is comprised of N sub-carriers at a spacing f_c. Each tone contains a complex symbol s_j. The composite signal is the array of complex symbols S = s_0,s_1 \ldots s_{N-1} , which are generated by modulating the input block C = \{c_0,c_1 \ldots c_{M-1}\}. This signal is transmitted over a time symbol of duration T_s. The complex signal envelope (prior to modulating on the carrier is given by Īnter% Attach:papr1.png Δ. The peak to average power ratio is then given by \mathcal{R} \sum_{k=0}^{N-1} s_i exp(-i2\pi k f_s t) . Here P_{avg} is given by the well known formula Attach:papr3.png Δ.
to:
Consider a signal which is comprised of N sub-carriers at a spacing f_c. Each tone contains a complex symbol s_j. The composite signal is the array of complex symbols S = s_0,s_1 \ldots s_{N-1} , which are generated by modulating the input block C = \{c_0,c_1 \ldots c_{M-1}\}. This signal is transmitted over a time symbol of duration T_s. The complex signal envelope (prior to modulating on the carrier is given by Īnter% Attach:papr1.png Δ. The peak to average power ratio is then given by \mathcal{R} \sum_{k=0}^{N-1} s_i exp(-i2\pi k f_s t) . Here P_{avg} is given by the well known formula P_{avg} = \Vert S \Vert = \sum {s_k}^2
October 06, 2009, at 07:47 AM
by ggne0015 -
Changed line 12 from:
Consider a signal which is comprised of N sub-carriers at a spacing f_c. Each tone contains a complex symbol s_j. The composite signal is the array of complex symbols S = s_0,s_1 \ldots s_{N-1} , which are generated by modulating the input block C = {c_0,c_1 \ldots c_{M-1}. This signal is transmitted over a time symbol of duration T_s. The complex signal envelope (prior to modulating on the carrier is given by Īnter% Attach:papr1.png Δ. The peak to average power ratio is then given by Īnter% Attach:papr2.png Δ. Here P_{avg} is given by the well known formula Attach:papr3.png Δ.
to:
Consider a signal which is comprised of N sub-carriers at a spacing f_c. Each tone contains a complex symbol s_j. The composite signal is the array of complex symbols S = s_0,s_1 \ldots s_{N-1} , which are generated by modulating the input block C = \{c_0,c_1 \ldots c_{M-1}\}. This signal is transmitted over a time symbol of duration T_s. The complex signal envelope (prior to modulating on the carrier is given by Īnter% Attach:papr1.png Δ. The peak to average power ratio is then given by \mathcal{R} \sum_{k=0}^{N-1} s_i exp(-i2\pi k f_s t) . Here P_{avg} is given by the well known formula Attach:papr3.png Δ.
October 06, 2009, at 07:43 AM
by ggne0015 -
Deleted lines 2-3:
Deleted line 9:
Changed line 12 from:
Consider a signal which is comprised of N sub-carriers at a spacing f_c_. Each tone contains a complex symbol s_j_. The composite signal is the array of complex symbols S = {s_0_,s_1_...s_N-1_}, which are generated by modulating the input block C = {c_0_,c_1_...c_M-1_}. This signal is transmitted over a time symbol of duration T_s_. The complex signal envelope (prior to modulating on the carrier is given by Īnter% Attach:papr1.png Δ. The peak to average power ratio is then given by Īnter% Attach:papr2.png Δ. Here P_avg_ is given by the well known formula Īnter% Attach:papr3.png Δ.
to:
Consider a signal which is comprised of N sub-carriers at a spacing f_c. Each tone contains a complex symbol s_j. The composite signal is the array of complex symbols S = s_0,s_1 \ldots s_{N-1} , which are generated by modulating the input block C = {c_0,c_1 \ldots c_{M-1}. This signal is transmitted over a time symbol of duration T_s. The complex signal envelope (prior to modulating on the carrier is given by Īnter% Attach:papr1.png Δ. The peak to average power ratio is then given by Īnter% Attach:papr2.png Δ. Here P_{avg} is given by the well known formula Attach:papr3.png Δ.
|
|