Wireless and CELLULAR COMMUNICATION (18EC81) Module-5
Wireless and CELLULAR COMMUNICATION (18EC81) Module-5
• For example 802.1 a/g WiFi systems, nearby users share the 20MHz bandwidth by
transmitting at different time after contending for the channel.
• OFDM accommodated by time sharing the channel.
5.1.1. Multiple-Access Overview
The most common ways to divide the available channel among the multiple users is through
• Frequency Division Multiple Access (FDMA): Each user receives a unique carrier
frequency and bandwidth.
• Time Division Multiple Access (TDMA): Each user is given a unique time slot, either on
demand or in a fixed rotation.
• Code Division Multiple Access (CDMA): Systems allow each user to share both the bandwidth
and time slots with many other users.
TDMA, FDMA, and orthogonal CDMA all have the almost same theoretical capacity in an
additive noise channel.
Limitation of above multiple access:
FDMA, TDMA, CDMA are bandwidth or interference limited system.
Orthogonality is not possible in dense wireless systems.
The above techniques only guarantee orthogonality between users in the same cell.
Different multiple access techniques have different delay characteristics and so may be appropriate for
different types of data.
Conclusion: The above limitation of conventional multiple access can be mitigated by principle merits of
OFDMA.
5.1.2. Random Access Vs. Multiple Access
• CSMA-Carrier Sense Multiple Access
• Used in Packet based communication System eg., Ethernet and wireless LAN such as 802.11.
• In random access, users contend for the channel, rather than being allocated a reserved time, frequency, or
code resource. Eg., ALOHA, SLOTTED ALOHA, CSMA.
• In ALOHA users simply transmit packets at will without regard to the other users. If the packet is not
acknowledged by the receiver after some period, it is assumed and is retransmitted.
• ALOHA is an inefficient method and delay is more as intensity of the traffic increases, as many
transmission result in collision and hence retransmission.
• SLOTTED ALOHA overcomes the problem of ALOHA by a factor of two since users transmits on
specified time boundaries hence collision reduces.
• CSMA improves upon ALOHA, SLOTTED ALOHA through carrier sensing, in which users listen to the
channel before transmitting in order to avoid collision.
• CSMA uses Distributed coordination function (DCF) of 802.11 in which user waits for a random amount
of time after the channel is clear before transmitting in order to reduce the probability to two stations
transmitting immediately after the channel becomes available
• The random access tends to be inefficient, systems sophisticated enough to have a frequency and code slots
generally opt for coordinated multiple access, rather than random access
5.1.3. Frequency Division Multiple Access (OFDM-FDMA)
Frequency Division Multiple Access (FDMA) can be readily implemented in OFDM systems by assigning
different users their own sets of subcarriers.
Available sub-carriers are distributed among all the users for transmission at any time instant
Each user is allocated a pre-determined band of subcarriers. Allows adaptive techniques per sub-carrier,
based on sub-channel condition.
Fig. 5.1. FDMA (left) and a combination of FDMA with TDMA (right)
The simplest method is a static allocation of subcarriers to each user, as shown on the left of figure 5.1. For
example, in a 64-subcarrier OFDM system, user 1 could take subcarriers 1-16, with users 2, 3, and 4 using
subcarriers 17-32, 33-48, and 49-64, respectively.
The allocations are enforced with a multiplexer for the various users before the IFFT operation.
OFDMA in LTE, however, has explicit time-sharing and procedures to allow for the dynamic allocation of
subcarriers.
In LTE use dynamic subcarrier allocation based upon channel state conditions. For example, due to
frequency selective fading, user 1 may have relatively good channels on subcarriers 33- 48, while user 3
might have good channels on subcarriers 1-16. Obviously, it would be mutually beneficial for these users to
swap the static allocations
5.1.4. Time Division Multiple Access (OFDM-TDMA)
• A particular user is given all the sub-carrier of the system for any particular symbol duration.
• Each user is assigned a time slot during which all the sub-carriers can be used for the particular user
• Adaptive loading can be performed on all the subcarriers, depending on channel conditions.
• The number of symbols per frame can be varied based on each user’s requirement.
• Power consumption reduction (less activity). Degrading performance should be taken into account in delay
constrained systems.
• A packet-based system like LTE can employ more sophisticated scheduling algorithms based on
queue-lengths, channel conditions, and delay constraints to achieve much better performance than
static TDMA.
5.1.5. Code Division Multiple Access (OFDM-CDMA or MC-CDMA)
• User data is spread over several sub-carriers and/or OFDM symbols using spreading codes, and combined
with signals from other users. OFDM and CDMA are shown in fig. 5.2.
• Hybrid access scheme that combines benefits:
• OFDM: Provides a simple method to overcome the ISI effect of the multi-path frequency selective channel
• CDMA: Provides frequency diversity and multi-user access scheme
• Several users transmit over the same sub-carriers.
• In wireless broadband networks the data rates already are very large, so spreading the spectrum further is
not viable.
• OFDM and CDMA are not fundamentally incompatible; they can be combined to create a Multicarrier
CDMA (MC-CDMA) waveform. MC-CDMA is not part of the LTE standard
Fig. 5.5. OFDMA uplink transmitter for user 1, where user 1 is allocated subcarriers 1,2….M of L total subcarriers.
[Adaptive modulation and coding]
Fig.5.6. OFDMA uplink receiver. All K active users-who by design have orthogonal subcarrier assignments—are
aggregated at the receiver and demultiplexed after the FFT. [EQ-equalizer]
OFDMA is not used in the LTE uplink. The block diagram of uplink OFDMA transmitter and receiver is
shown in figure 5.5 and 5.6 respectively.
• The transmitter modulates user 𝑘′𝑠 bits over just the subcarriers of interest: in this case, we
have chosen 𝑘 = for all users, and shown user 1 occupying subcarriers 1,2, • • , M of the L
total subcarriers.
• All the users' signals collide at the receiver's antenna, and are collectively demodulated using the
receiver's FFT.
• Assuming each subcarrier has only a single user on it, the demodulated subcarriers can be de-
mapped to the detectors for each of the K served users.
• It should be noted that uplink OFDMA is considerably more challenging than downlink OFDMA
since the uplink is naturally asynchronous, that is the users' signals arrive at the receiver offset
slightly in time (and frequency) from each other.
• This is not the case in the downlink since the transmitter is common for all users. These time and
frequency offsets can result in considerable self-interference if they become large.
• Particularly in the distributed subcarrier mode, sufficiently large frequency offsets can severely
degrade the orthogonality across all subcarriers.
• The timing offsets also must typically be small, within a fraction of a cyclic prefix.
• In LTE the uplink multi access scheme uses only the localized subcarrier mode due to the SC-
FDMA nature of the uplink.
• In this case, the lack of perfect frequency and time synchronization between the multiple users
leads to some ICI (Inter Channel Interference) but this is limited only to the subcarriers at the
edge of the transmission band of each user.
• Frequency and timing synchronization for the uplink is achieved relative to the downlink
synchronization, which is done using the synchronization channels.
• A higher level view of OFDMA can be seen in figure 5.7 Here, a base station is transmitting a
band AMC-type OFDMA waveform to four different devices simultaneously.
• The three arrows for each user indicate the signalling that must happen in order for band AMC-
type OFDMA to work.
• First, the mobiles measure and feedback the quality of their channel, or channel state
information (CSI) to the base station.
• Usually, the CSI feedback would be a measurement corresponding to SINR.
• The base station would then allocate subcarriers to the four users and send that subcarrier
allocation information to the four users in an overhead message.
• Finally, the actual data is transmitted over the Subcarriers assigned to each user.
• Here, it can be seen that the base station was successful in assigning each user a portion of the
spectrum where it had a relatively strong signal.
Fig. 5.7. In OFDMA, the base station allocates each user a fraction of the subcarriers, preferably, in a range where
they have a strong channel.
5.3.2. SCFDMA-Working
SC-FDMA uplink transmitter:
• SC-FDMA uplink transmitter is shown in figure 5.8.
Fig. 5.8: SC-FDMA uplink transmitter for user 1, where user 1 is allocated subcarriers 1, 2,…...M of L total
subcarriers
• The only difference that the user's 𝑘 complex symbols are pre-processed with an FFT of size 𝑘
The base station only transmits to the user with highest channel gain, expressed as
.
It is easy to verify that the PDF of is
Fig. 5.10. Probability density function of , the maximum of K users’ channel gains
Fig. 5.11. Avearge capacity (left) and QPSK bit error rate (right) for different numbers of users K.
The idea is to develop algorithms for determining which users to schedule. How to allocate subcarriers to
them, and how to determine the appropriate power levels for each user on each subcarrier.
The different possible approaches to resource allocation are discussed here. Obtaining high throughput with fairness
among the users in the system is the class of technique used.
We generally assume that the outgoing queues for each user are full, but in practice the algorithms discussed here
can be modified to adjust for queue length. The subcarrier mapping must be broadcast to all users whenever
the resource allocation changes:
Typically, the resource allocation must be performed on the order of the channel coherence time;
The resource allocation is usually formulated as a constrained optimization problem to either
(1) Minimize the total transmit power with a constraint on the user data rate or to
(2) Maximize the total data rate with a constraint on total transmit power.
The first objective is appropriate for fixed-rate applications (e.g., voice), while the second is more appropriate for
bursty applications like data and other IP applications.
5.4.3. Maximum Sum Rate Algorithm
The objective of the maximum sum rate (MSR) algorithm is to maximize the sum rate of all users, given a total
transmit power constraint.
The drawback of the MSR algorithm is that it is likely that a few users that are close to the base station (and
hence have excellent channels) will be allocated all the system resources.
The SINR, data rate, and power and subcarrier allocation that is achieved by the MSR algorithm are
discussed.
Let denote user k's transmit power in subcarrier l. The signal-to-interference plus-noise ratio for user k in
subcarrier l, denoted as can be expressed as
∑
𝐿
where AWGN power spectrum density
L Total number of subcarriers
∑∑
𝐿
∑∑
The sum capacity is maximized if the total throughput in each subcarrier is maximized.
Hence, the max sum capacity optimization problem can be decoupled into L simpler problems, one for each
subcarrier.
Further, the sum capacity in subcarrier l, denoted as , can be written as
∑
𝐿
In a wireless broadband network, it is likely that different users require application-specific data rates that
vary substantially.
A generalization of the Maximum Fairness algorithm is the Proportional Rate Constraints (PRC)
algorithm, whose objective is to maximize Sum throughput, with the additional constraint that each
user's data rate is proportional to a set of pre-determined system parameters . Mathematically, the
proportional data rate's constraint can be expressed as
∑
𝐿
𝐿
and can only be the value of either 1 or 0, indicating whet her subcarrier is used by user k or not. Clearly, this
is the same setup as the Maximum Fairness algorithm if =1 for each user.
The advantage is that any arbitrary data rates can be achieved by varying the values.
The PRC optimization problem is also generally very difficult to solve directly, since it involves both
continuous variables and binary variables and the feasible set is not convex.
As for the Maximum Fairness case, the prudent approach is to separate the subcarrier and power allocation, and to
settle for a near-optimal subcarrier and power allocation that can be achieved with manageable complexity.
5.4.6. Proportional Fairness Scheduling
The three algorithms we have discussed thus far attempt to instantaneously achieve an objective such as the total
sum throughput (MSR algorithm), maximum fairness (equal data rates among all users), or pre-set
proportional rates for each user.
Alternatively one could attempt to achieve such objectives over time, which provides significant additional
flexibility to the scheduling algorithms.
In this case, in addition to throughput and fairness, a third element enters the tradeoff, which is latency.
In an extreme case of latency tolerance, the scheduler could simply just wait for the user to get close to the base
station before transmitting.
In fact, the MSR algorithm achieves both fairness and maximum throughput if the users are assumed to have the
same average channels in the long term (on the order of minutes, hours, or more), and there is no constraint with
regard to latency.
Since latencies even on the order of seconds are generally unacceptable, scheduling algorithms that balance
latency and throughput and achieve some degree of fairness are needed.
The most popular framework for this type of scheduling is Proportional Fairness (PF) scheduling.
The PF scheduler is designed to take advantage of multiuser diversity, while maintaining comparable long-
term throughput for all users.
Let denote the instantaneous data rate that user k can achieve at time t, and be the average
throughput for user k up to time slot t.
The Proportional Fairness scheduler selects the user, denoted as k*, with the highest for
transmission.
In the long-term, this is equivalent to selecting the user with the highest instantaneous rate relative to its mean
rate.
The average throughput for all users is then updated according to
( ) 𝑘 𝑘
( ) 𝑘 𝑘
{
Since the Proportional Fairness scheduler selects the user with the largest instantaneous data rate relative to
its average throughput, "bad channels for each user are unlikely to be selected.
On the other hand, users that have been consistently underserved receive scheduling priority, which promotes
fairness.
The parameter controls e latency of the system. If is large, then the latency increases, with the benefit of
higher sum throughput. If is small, the latency decreases since the average throughput values change more
quickly, at the expense of some throughput.
The Proportional Fairness scheduler has been widely adopted in packet data systems such as HSPDA and
lxEVDO, where is commonly set between 10 and 20.
One interesting property of PF scheduling is that as , the sum of the logs of the user data rates is
maximized. That is, PF scheduling maximizes ∑ or equivalently∏ .
Although the Proportional Fairness scheduler was originally designed for a single users channel, time-
slotted system, it can be adapted to an OFDMA system.
In an OFDMA system, due to the multiple parallel subcarriers in the frequency domain, multiple users can
transmit on different subcarriers simultaneously.
The original PF algorithm can be extended to OFDMA by treating each subcarrier independently.
Let be the supportable data rate for user k in subcarrier in at time slot t. Then for each subcarrier the
user with the largest is selected for transmission.
Let denote the set of subcarriers in which user k is scheduled for transmission at time slot t, then the
average user throughput is updated as
( ) ∑
for k = 1,2,.. . , K. Other weighted adaptations and evolutions of PF scheduling of OFDMA are certainly
possible.
5.4.7. Performance Comparison
In this section, we briefly compare the performance of the various scheduling algorithms for OFDMA that we
have discussed, in order to gain intuition on their relative performance and merits.
In these results, an exponentially decaying multipath profile with six multipath components was used to
generate the frequency diversity.
All users have the same average SNR. The absolute capacity numbers are not especially important; what are
important are the trends between the different curves.
Throughput First, we consider the multiuser diversity gains of the different types of algorithms. Figure 5.12
shows the capacity (normalized by the total bandwidth) for static TDMA (round robin), Proportional Fairness,
and the maximum sum rate (MSR) algorithm.
As expected, the MSR algorithm achieves the best total throughput, and the gain increases as the number of
users’ increases, on the order of log log K.
Static TDMA achieves no multiuser gain, since the users transmit independent of their channel realizations.
It can be seen that the proportional fairness algorithm approaches the throughput of the MSR algorithm, with an
expected penalty due to its support for under-served users.
Fairness Now, let us consider how the worst user in the system does: this is shown the left of Figure 5.13.
As expected, the Maximum Fairness algorithm achieves the best performance for the most under-served user,
with a slight gain for optimal power allocation over its allocated subcarriers (waterfilling) relative to an equal
power allocation.
Also as expected, the MSR algorithm results in a starved worst case user-in fact, Static TDMA performs in-
between the two, with the percentage loss relative to the Maximum Fairness algorithm increasing as the number
of user’s increases, since TDMA does not take advantage of multiuser diversity
Fig. 5.12 Sum capacity vs. number of users for a single carrier system (scheduling is in time domain only).
Consider a heterogeneous environment with eight users. The first user has an average SINR of 20dB, the second
user has an average SINR of 10 dB and user3-8 have average SINRs of 0dB. This is a reasonable scenario in which
user 1 is close to the base station, user 3-8 are near the cell edge and user 2 is in between.
As shown in figure 5.13. MSR algorithm allocates bulk resources to user 1and user 2 and user3-8 has a through put
of approximately zero. A Proportional rate constraint algorithm (PRC) is balanced algorithm used.
Fig. 5.13. (Left) Minimum user capacity in multiuser OFDMA vs. the number of users (right). Normalized
average throughput per user in a heterogeneous environment
Summary of Comparison
Table 5.5 compares the four resource allocation algorithms that this chapter introduced for OFDMA
systems.
In summary, the Maximum Sum Rate allocation is the best in terms of total throughput, achieves a low
computational complexity, but has a terribly unfair distribution of data rates.
Hence, the MSR algorithm is viable only when all users have nearly identical channel conditions and a
relatively large degree of latency is tolerable.
The Maximum Fairness algorithm achieves complete fairness while sacrificing significant throughput,
and so is appropriate only for fixed, equal rate applications.
The Proportional Rate Constraints (PRC) algorithm allows a flexible tradeoff between these two
extremes, but it may not always be possible to aptly set the desired rate constraints in real time.
Fig.5.13a The Structure of LTE Time –Frequency Grid (LTE FDD frame of 1.4 MHz channel)
Throughput, delay, and fairness, they are not specified by LTE. Rather, LTE simply specifies how resources may be
assigned, and how to notify the mobile units of the assignment. Figure 5.13a shows the structure of LTE Time –
Frequency Grid (LTE FDD frame of 1.4 MHz channel)
The downlink resource block of LTE is shown in figure 5.10: a typical resource block consists of 12 subcarriers
over 7 OFDM symbols, also referred to as a timeslot.
A timeslot in LTE spans 0.5 msec and two consecutive timeslots create a subframe.
Resources are allocated to users in units of resource blocks over a subframe, that is, 12 subcarriers over 2 x 7 =
14 OFDM symbols for a total of 168 "resource elements," which used for data since some are used for various
layer 1 and layer 2 control messages.
The subcarriers of a resource block can be allocated in one of two ways.
The first way, known as distributed subcarrier allocation, takes advantage of frequency diversity by
spreading the resource block hop across the entire channel bandwidth. This can be accomplished by using a
"comb" pattern at any given point of time for a given user, so that its subcarriers occur at even intervals across
the entire frequency bandwidth. This approach is typically used in the downlink (OFDMA) when distributed
subcarrier allocation is used.
Alternatively, frequency diversity can be achieved by hopping a contiguous block of subcarriers in time, for
example, the 12 subcarriers in a resource block could hop to a different part of the spectrum over each of the 14
OFDM symbols utilized.
Since the channel is generally relatively constant over 14 OFDM symbols, frequency diversity is achieved as
long as sufficient interleaving is employed: this is certainly the case 1n LTE systems, which are heavy on
interleaving.
This approach is used in the uplink, Since SC-FDMA transmitters in general operate on contiguous sets of
subcarriers as seen in figure 5.8.
The second way to allocate subcarriers is adjacent subcarrier allocation. This approach relies on a channel-
aware allocation of resources, so that each user can be allocated a resource block where they have a strong
channel. Since a block of 12 subcarriers is typically smaller than the coherence bandwidth of the channel,
frequency diversity is not achieved, which is helpful as long as the scheduler is able to assign "good" blocks to
each user.
Once a user is able to decode the PDCCH, it knows precisely where to receive (downlink or to transmit
(uplink), and how. The PDCCH is sent over the first 2-3 OFDM symbols of each subframe across all the
subcarriers.
Each allocation, which consists of a resource block subframe, consisted of 168 subcarriers over 14 OFDM
symbols. Since the first 2-3 symbols in each subframe are used by the PDCCH, about 14-21% of the total
downlink capacity is used by the PDCCH.
Additional downlink capacity is also used by other control channels and the pilot symbols.
To aid the base station in uplink scheduling, LTE units utilize buffer status reporting (BSR), wherein each
user can notify the BS about its queue length, and channel quality information (CQI) feedback.
Once the BS is well informed about the channels to/from the users and their respective queue lengths, it can
more appropriately determine users. In the downlink, the BS has inherent knowledge of the amount of
buffered data for each user, while in the uplink it can estimate the channel from each user.
Hence, BSR feedback is only used for uplink scheduling while CQI feedback is only used for downlink
scheduling and AMC-mode selection. The CQI reporting can be either periodic or aperiodic, wideband or
subband, and multiple CQI feedback modes are defined for different scenarios.
Furthermore, if power control is not used, the different signals may be received with very different powers,
which causes a dynamic range problem when the signal is A/D converted-that is, the strong users will dominate
the A/D dynamic range and the weak users will experience severe quantization noise, making digital
reconstruction of those signals difficult or impossible.
In short, some uplink power control is needed in OFDMA (or SC-FDMA) systems.
In LTE, closed-loop power control is possible in the uplink where the BS can explicitly indicate the maximum
transmit power density (power per resource block) that can be used by each user.
This information is carried on the PDCCH when the uplink allocation for each user is specified.
The uplink loop power control algorithm in LTE is flexible in terms of the amount of channel inversion it
performs.
On one extreme, channel inversion can be used, which results in the same received power for all users
regardless of their channel conditions.
This maximizes fairness. On the other hand, no power control can be used-all users transmit at full power- but
low battery efficiency and poor fairness, as cell edge users are disadvantaged.
These two extremes can be balanced by fractional power control, whereby the channel is partially inverted, that
is, the transmit power is proportional to where s is a fractional value between 0 and 1. Note that fixed
transmit power corresponds to s =0 and full channel inversion to s = 1.
Fractional power control is the open-loop power control scheme in LTE. In the downlink, no closed-loop
power control is specified in the standard
5.6. OFDMA system Design Considerations.
The first concerns the allocation of resources n à cellular network, where the actions of one base station affect
its neighbours.
The second is a point is diversity gain from opportunistic scheduling in a system like LTE and channel using
coding, adaptive modulation, OFDM, and multiple antenna techniques.
For example, if a certain MS near the cell edge (presumably with a low SINR) is selected to transmit in the
uplink at high power, this will lower the effective SINRs of all the users in the cell next to it, hence perhaps
changing the ideal subcarrier allocation and burst profile for that cell. Therefore, a cellular OFDMA system
greatly benefits from methods for suppressing avoiding the interference from adjacent cells.
A simple approach is to use a unique frequency hopping pattern for each base station to randomize to the
other cell interference, an approach popularized by the Flarion (now part of Qualcomm) scheme called FLASH-
OFDM. Although this scheme reduces the probability of a worst-case interference scenario, under a high-
system load the interference levels can still rapidly approach untenable levels and the probability of collision
can grow large.
A more sophisticated approach is to develop advanced receivers that are capable of cancelling the interference
from a few dominant interference sources. This is a challenging proposition even in a single-carrier system, and
its viability in a cellular OFDMA system is open to debate.
An appealing approach is to revisit the resource allocation algorithms discussed in Section 5.4.2 in the context
of a multi-cell system. If each base station is unaware of the exact conditions in the other cells, and no
cooperation among neighbouring base stations is allowed, the subcarrier and power allocation follows the theory
of non-cooperative games and typically results in a Nash equilibrium, where no user can benefit by unilaterally
deviating from their current allocation.
Simply put, this scenario is the equivalent of gridlock: for example, the users reach a point where neither
increasing nor decreasing their power improves their capacity.
The convergence time of such approaches is generally not fast enough to be of much use in an LTE system
anyway.
Better performance can be obtained if there is some cooperation between the base stations. For example, there
could be a master scheduler for all the base stations that knew the channels in each and every base station and
made multi-cell resource allocation schedules accordingly.
This would be prohibitively complex, though, due to (1) transferring large amounts of real-time information to
and from this centralized scheduler, and (2) the computational difficulties involved in processing this quantity
of information to determine a globally optimal or near-optimal resource allocation.
Strict FFR and Soft Frequency Reuse (SFR). In a Strict FFR system, users in the interior of the cells
universally share a common sub-band of frequencies, while the cell edge users' bandwidth is
partitioned based on a reuse factor of N, requiring a total of N+1 sub-bands.
It is termed "strict" because interior users do not share any spectrum with edge users, which reduces interference
for both interior users and edge cell users.
Fig.5.14. Strict fractional frequency Reuse (left) and Soft Frequency Reuse (right) geometry with N=3 cell
edge reuse factors.
Soft Frequency Reuse employs a similar partitioning strategy as Strict FFR, with the exception that interior
users can share the same bandwidth as edge users in adjacent cells.
As a result, cell interior users typically transmit at lower power levels than the cell-edge users in order to reduce
interference to neighbouring cells.
While SFR is more bandwidth efficient than strict FFR, it allows more interference to both cell interior and edge
users.
Since the cell partitions are based on the geometry of the network, the locations of the users are important in
order to determine the frequency partitions.
However, one practical method to determine user classifications is for each cell to use the average received
SINR of its users, which is usually a good indicator of the distance of the user from its base station.
The base station then classifies users with average SINR less than a pre-determined threshold as edge users,
while users with average SINR greater than the threshold are classified as interior users.
Figure 5.15 shows the results of a simulation comparing the two main FFR schemes with standard N = 1
frequency reuse.
A total of 48 resource blocks (RBs) are available, users are uniformly distributed over the 12-cell network, and a
high traffic load is assumed.
The cell coverage radius is 1 km and the interior radius, which determines the number of interior and edge users
served, is varied from 0.25 to 0.95 km.
The plot on the left of figure 5.15 shows the significant benefit the Strict FFR scheme provides for edge users
over SFR and universal frequency reuse.
However, the plot on the right shows that if the network has a moderate or high traffic load, this benefit comes
at a cost of not being able to fairly serve all users.
Fig. 5.15 Edge user performance (left); Spectral efficiency of the reuse schemes
Now, if ten different users were to execute an OFDMA scheduling algorithm, although the overall
performance would increase further, the multiuser diversity gain would be less than that without the selection
diversity, since each user has already eliminated their worst channels with the selection combining.
The intuition of this simple example can be extended to other diversity-exploiting techniques, like coding and
interleaving space-time and space-frequency codes, and so on.
In short, the total diversity gain will be less than the sum of the diversity gains from the individual techniques.
Figure 5.16 shows the combined effect off multiuser and spatial diversity for five different configurations of
2 x 1 MIMO systems: single antenna (SISO), opportunistic beam- forming, Alamouti STBCs (Space Time
Block Coding), and transmit beamforming with limited feedback (1-bit CSI) and perfect CSI.
For a single user, the SISO and opportunistic BF is the lease effective, since opportunistic BF requires
multiuser diversity to get a performance gain over SISO.
Alamouti codes increase performance, in particular reducing the probability; of a very low SINR from
occurring.
The CSI-endowed techniques do the best; notably the perfect CSI case is always 3 dB better than Alamouti
codes regardless of the number of users.
When the system does have 50 users, however, some of the conclusions change considerably.
Now, Alamouti codes actually perform worse than single-antenna transmission. This is because Alamouti
codes harden the received SINR toward the average and so the SINR difference between the users is attenuated
but this is exactly what is exploited by a multiuser scheduler that picks the best out of the 50 users.
Fig. 5.16 The SINR of multiuser diversity combined with antenna diversity techniques.
The numbers of users K=1 (left), K=50 (right).
• Unlike 2G and 3G cellular systems that were designed mainly with voice services in mind, LTE was
designed primarily for high-speed data services, which is why LTE is a packet-switched network from end
to end and has no support for circuit-switched services.
• However, the low latency of LTE and its sophisticated quality of service (QoS) architecture allow a
network to emulate a circuit-switched connection on top of the packet-switched framework of LTE.
Network Architecture:
• Unlike 3G networks, LTE was designed to support packet- switched traffic with support for various QoS
classes of services.
• Previous generations of networks such as UMTS/HSPA and IxRTT (Single carrier Radio Transmission
Technology/EvDO-Evolution Data Optimized) also support packet-switched traffic but this was
achieved by subsequent add-ons to the initial version of the standards.
• For example, HSPA, which is a packet-switched protocol (packet-switched over the air), was built on
top of the Release 99 UMTS network and as a result carried some of the unnecessary burdens of a
circuit-switched network.
• LTE supports packet switching for high data rate services from thestart.
• The LTE radio access network, E-UTRAN, was designed to have the minimum. number of interfaces (i.e.,
the minimum. number of network elements) while still being able to provide efficient packet-switched
transport for traffic belonging to all the QoS classes such as conversational, streaming, real-time, non-
real-time, and background classes.
• The design target for downlink and uplink peak data rates for LTE are 100 Mbps und 50 Mbps,
respectively, when operating at the 20MHz frequency division duplex (FDD) channel size.
• The user-plane latency is defined in terms of the time it takes to transmit a small IP packet from the UE
to the edge node of the radio access network (also called as base station) or vice versa measured on the IP
layer.
• The target for one-way latency in the user plane is 5 ms in an unloaded network, that is, if only a
single UE is present inthe cell.
• For the control-plane latency, the transition time from a camped state to an active state is less than 100
ms, while the transition time between a dormant state and an active state should be less than 50 ms.
Performance Requirements:
• The target performance requirements for LTE are specified in terms of spectrum efficiency, mobility, and
coverage, and they are in general expressed relative to the 3GPP Release 6 HSPA.
• Spectrum Efficiency
• The average downlink user data rate und spectrum Efficiency target is three to four times that of the
baseline HSDPA (High Speed Downlink Packet Access) network. Similarly, in uplink the average user
data rate and spectrum efficiency.
• Similarly, in the uplink the average user data rate and spectrum efficiency target is two to three times that
of the baseline HSUPA (High Speed Uplink Packet Access) network.
• The cell edge throughput, measured as the 5th percentile throughput, should be two to three times that of
the baseline HSDPA and HSUPA
Mobility
• The mobility requirement for LTE is to be able to support hand off/ mobility at different terminal speeds.
• Maximum performance is expected for the lower terminal speeds of 0 to 15 km/hr, with minor degradation
in performance at higher mobilespeeds up to 120 km/hr.
• LTE is also expected to be able to sustain a connection for terminal speeds up to 350 km/hr but with
significant degradation in the system performance.
Coverage
• For the cell coverage, the above performance targets should be met up to 5 km.
• For cell ranges upto 30km, a slight degradation of the throughput is tolerated and a more
significant degradation for spectrum efficiency is acceptable, but the mobility requirements
should be met.
• Cell ranges up to 100 km should not be precluded by the specifications.
MBMS Services:
• LTE should also provide enhanced support for Multimedia Broadcast and Multicast Services (MBMS)
compared to UTRA operation.
The radio resource management requirements cover various spots such as enhanced support for
end-to-end QoS,
efficient support for transmission of higher layers,
and support for load sharing/balancing and
Policy management enforcement across different radio access technologies.
Standalone deployment scenario, where the operation deploys LTE either with no previous network
deployed in the area or with no requirement for interworking with the existing UTRAN/GERAN (GSM
Integrating with existing UTRAN/GERAN deployment scenario, where the operator already has either
a UTRAN and/or GERAN network deployed with full or partial coverage in the same geographical area.
In order to become a truly global standard, LTE was designed to be operable under a wide variety of spectrum
scenarios, including its abilityto coexist and share spectrum with existing 3G technologies.
Service providers in different geographical regions often have different spectrums in terms of the carrier
frequency and total available bandwidth, which is why LTE was designed to have a scalable bandwidth from
1.4MHz to 20MHz.
In order to accommodate flexible duplexing options, LTE was designed to operate in both frequency division
duplex (FDD) and time division duplex (TDD) modes.
Multimode LTE terminals, which support UTRAN and/or GERAN (GSM EDGE Radio Access Network) (
Enhanced Data rates for GSM Evolution (EDGE) GSM-Global System for Mobile Communication) operation
should be able to support measurement of, and handover from and to, both 3GPP UTRAN und 3GPP GERAN
systems with acceptable terminal complexity and network performance.
• eNode-B: The eNode-B (also called the base station) terminates the air interface protocol and is the first
point of contact for the UE.
As in figure 5.17.The eNode-B is the only logical node in the E-UTRAN, so it includes some
functions previously defined in the RNC of the UTRAN, such as radio bearer management, uplink
and downlink dynamic radio resource management and data packet scheduling, and mobility
management.
• Mobility Management Entity (MME): MME is similar in function to the control plane of legacy Serving
GPRS Support Node (SGSN). It manages mobility aspects in 3GPP access such as gateway selection and
tracking area list management.
• Serving Gateway (Serving GW): The Serving GW terminates the interface towards E-UTRAN, and
routes data packets between E-UTRAN and EPC.
• It is the local mobility anchor point for inter eNode-B handovers and also provides an anchor for inter-3GPP
mobility. The other responsibilities include lawful intercept, charging and dome policy enforcement. The
Serving GW and the MME may be implemented in one physical node or separate physical nodes.
• Packet Data Network Gateway (PDN GW): The PDN GW terminates the SGi interface toward the Packet
Data Network (PDN). It routes data pickets between the EPC and the external PDN, and is the key node for
policy enforcement and charging data collection. It also provides the anchor point for mobility with non-
3GPP accesses. The external PDN can be any kind of IP network as well as the IP Multimedia Subsystem
(IMS) domain. The PDN GW and the Serving GW may be implemented in one physical node or separated
physical nodes.
• S1 Interface: The S1 interface is the interface that separates the E-UTRAN and the EPC. It is split into two
parts:
• the S1-U, which carries traffic data between the eNode-B and the Serving GW, and the
• S1-MIME, which is a signaling-only interface between the eNode-B and the MME.
• X2 Interface: The X2 interface is the interface between eNode-Bs, consisting of two parts:
• It is assumed that there always exists an X2 interface between Node-Bs that needs to communicate with
each other, for example, for support of handover.
LTE radio interface is designed based on a layered protocol stack, which can be divided into control plane and
user plane protocol stacks and is shown in figure 5.19. The packet flow in the user plane is shown in figure 5.20.
The LTE radio interface protocol is composed of the following layers
Radio Resource Control (RRC): The RRC layer performs the control plane functions including paging,
maintenance and release of an RRC connection- security handling-mobility management, and QoS management.
The main functions of the PDCP sub layer include IP packet header compression and decompression based on
the Robust Header Compression (ROHC) protocol, ciphering of data and signaling and integrity protection for
signaling. There is only one PDCP entity at the eNode-B and the UE per bearer.
data units, error correction through the Automatic Repeat reQuest (ARQ) protocol, and in-sequence delivery of
packets to the higher layers. It operates in three modes:
– The Transparent Mode (TM): The TM mode is the simplest one, without RIC header addition, data
segmentation, or concatenation, and it is used for specific purposes such as random Access.
– The Unacknowledged Mode (UM): The UM mode allows the detection of packet loss and provides packet
reordering and reassembly, but does not require retransmission of the missing protocol data units (PDUs)
– The Acknowledged Mode (AM): The AM mode is the most complex one, and it is configured to request
retransmission of the missing PDUs in addition to the features supported by the UM mode.
There is only one RLC entity at the eNode-B and the UE per bearer.
Medium Access Control (MAC): The main functions of the MAC sublayer include error correction through
the Hybrid-ARQ (H-ARQ) mechanism, mapping between logical channels and transport channels,
multiplexing/'demultiplexing of RLC PDUs on to transport blocks, priority handling between logical channels
of one UE, and priority handling between UEs by means of dynamic scheduling.
Physical Layer (PHY): The main function of PHY is the actual transmission and reception of data in the
forms of transport blocks. The PHY is also responsible for various control mechanisms such as
signalling of H-ARQ feedback, signalling of scheduled allocations, and channel measurements.
To efficiently support various QoS classes of services, LTE adopts a hierarchical channel structure. There
are three different channel types defined in LTE
Each layer is associated with a service access point (SAP) between different layers.
These channels are used by the lower layers of the protocol stack to provide services to the higher
layers. The radio interface protocol architecture and the SAPs between different layers are shown in figure
5.21.
Logical channels provide services at the SAP between MAC and RLC layers, while transport channels
provide services at the SAP between MAC and PHY layers.
Physical channels are the actual implementation of transport channels over the radio interface.
Fig. 5.21: The radio interface protocol architecture and the SAPs b/w different layers
• Broadcast Control Channel (BCCH): A downlink common channel used to broadcast system
control information to the mobile terminals in the cell, including downlink system bandwidth,
antenna configuration, and reference signal power. Due to the large amount of information carried on
the BCCH, it is mapped to two different transport channels: the Broadcast Channel (BCH) and the
Downlink Shared Channel (DL- SCH).
• Paging Control Channel (PCCH): A downlink channel that transfers paging information to
registered UEs in the cell, for example, in case of a mobile-terminated communication session.
The logical traffic channels, which are to transfer user plane information, include:
• Multicast Traffic Channel (MTCH): A unidirectional point-to-multipoint data channel that transmits
traffic data from the network to UEs. It is associated with multicast/broadcast service.
The transport channels are used by the PHY to offer services to the MAC.
A transport channel is basically characterized by how and with what characteristics data is transferred over the
radio interface, that is, the channel coding scheme, the modulation scheme, and antenna mapping.
LTE defines two MAC entities: on in the UE and one in the E-UTRAN, which handle the following
downlink/uplink transport channel.
• Downlink Shared Channel (DL-SCH): Used for transmitting the downlink data, including both control
and traffic data, and thus it is associated with both logical control and logical traffic channels. It supports H-
ARQ, dynamic link adaption, dynamic and semi-persistent resource allocation, UE discontinuous reception,
and multicast/broadcast transmission.
• Broadcast Channel (BCH): A downlink channel scouted with the BCCH logical channel and is used to
broadest system information over the entire coverage area of the cell. It has a fixed transport format defined
by the specifications.
Multicast Channel (MCH): Associated with MCCH and MTCH logical channels for the
multicast/broadcast service. It supports Multicast/Broadcast Single Frequency Network (MBSFN)
transmission, which transmits the same information on the same radio resource from multiple synchronized
base stations to multiple UEs.
• Paging Channel (PCH): Associated with the PCCH logical channel. It is mapped to dynamically
allocate physical resources, and is required for broadcast over the entire cell coverage area. It is transmitted
on the Physical Downlink Shared Channel (PDSCH), and supports UE discontinuous reception.
Uplink Transport Channels
• Uplink Shared Channel (UL-SCH): The uplink counterpart of the DL-SCH. It can be associated to
CCCH, DCCH, and DTCH logical channels. It supports H-ARQ, dynamic link adaption, and dynamic and
semi-persistent resource allocation.
• Random Access Channel (RACH): A specific transport channel that is not mapped to any logical
channel. It transmits relatively small amounts of data for initial loss or, in the case of RRC, state changes.
• Downlink Control Information (DCI): It carries information related to downlink/uplink scheduling
assignment, modulation and coding scheme, and Transmit Power Control (TPC) command, and is sent
over the Physical Downlink Control Channel (PDCCH). The DCI supports 10 different formats, listed in
Table 5.6. Among them, Format 0 is for signalling uplink transmission allocation, Format 3 and 3A
for TPC andthe remaining formats ire for signalling downlinks transmission allocation.
Control Format Indicator (CFI): It indicates how many symbols the DCI spans in that sub frame. It takes
values CFI = 1, 2, or 3, and is sent over the Physical Control Format Indicator Channel (PCFICH).
• H-ARQ Indicator (HI): It carries H-ARQ acknowledgment in response to up link transmissions, and is
sent over the Physical Hybrid ARQ Indicator Chanel (PHICH). HI = 1 for a positive acknowledgement
(ACK) and HI = 0 for a negative acknowledgment (NAK).
3 Format 1A Compact downlink scheduling for one codeword and random access
procedure
6 Format 1D Compact downlink scheduling for one codeword with precoding and power
offset information
9 Format 3 TPC commands for PUCCH and PUSCH with 2-bit power adjustment
10 Format 3A TPC commands for PUCCH and PUSCH with 1-bit power adjust
These channels are also used in both direction downlink and uplink directions.
Each physical channel corresponds to a set of resources elements in the time frequency grid that carry
information from higher layers.
The basic entities of physical channel are resources elements and resources blocks.
A resource element is a single subcarrier over one OFDM symbol and typically carry one symbol.
A resource block is a collection of resource elements and in the frequency domain this represents smallest
quanta of resources that can be allocated.
Physical Downlink Control Channel (PDCCH): It carries information about the transport format and
resource allocation related to the DL-SCH and PCH transport channels, and the H-ARQ information related
to the DL-SCH. It also informs the UE about the transport format, resource allocation, and H-ARQ
information related to UL-SCH. It is mapped from the DCI transport channel.
Physical Downlink Shared Channel (PDSCH): This channel carries user data and higher-layer signalling.
It is associated to DL-SCH and PCH.
Physical Broadcast Channel (PBCH): It-corresponds to the BCH transport channel and carries system
information.
Physical Multicast Channel (PMCH): It carriers multicast/broadcast information for the MBMS service.
Physical Hybrid-ARQ Indicator Channel (PHICH): This channel carries H-ARQ ACK/NAKs associated
with uplink data transmissions. It is mapped from the HI transport channel.
Physical Control Format Indicator Channel (PCFICH): It informs the UE about the number of OFDM
symbols used for the PDCCH. It is mapped from the CFI transport channel.
Physical Uplink Control Channel (PUCCH): It carries uplink control information including Channel
Quality Indicators (CQI), ACK/NAKs for H-ARQ in response to downlink transmission, and uplink
scheduling requests.
Physical Uplink Shared Channel (PUSCH): It carries user data and higher layer signalling. It corresponds
to the UL-SCH transport channel.
Physical Random Access Channel (PRACH): This channel carries the random access preamble sent by
UEs.
Reference signal: It is defined in both downlink and uplink for channel for estimation that enable
coherent demodulation. Three different receive signal in downlink are
UE-specific reference signals: There are two types of uplink reference signals:
Synchronization signal: It is split into a primary and a secondary synchronization signal, and is only
defined in the downlink to enable acquisition of symbol timing and the precise frequency of the downlink
signal.
From the description of different channel types, we see that there exists a good correlation based on the purpose
.
Fig. 5.23: Mapping between different channel types
This requires a mapping between the logical channels and transport channels at the MAC SAP (Service
Access Points) and a mapping between transport channels and physical channels at the PHY SAP.
Such channel mapping is not arbitrary, and the allowed mapping between different channel types is shown in
Figure 5.23, while the mapping between control information and physical channels is shown in Figure 5.24.
It is possible for multiple channels mapped to a single channel, for example, different logical control channels
and logical traffic channels are mapped to the DL-SCH transport channel
In LTE, the downlink and uplink use different transmission schemes due to different considerations.
Here, we describe downlink and uplink radio transmission schemes, respectively. In the downlink, a scalable
OFDM transmission/multi-access technique is used that allows for high spectrum efficiency by utilizing
multiuser diversity in a frequency selective channel.
On the other hand, SC- FDMA transmission, multi-access technique is used in the uplink since this reduces the
peak-to-average power ratio (PAPR) of the transmitted signal.
The transceiver structure of OFDM with FFT/IFFT enables scalable bandwidth operation with a low
complexity, which is one of the major objectives of LTE.
As each subcarrier becomes a flat fading channel, compared to single-carrier transmission OFDM makes it
much easier to support multi-antenna transmission, which isa key technique to enhance the spectrum efficiency.
• OFDM enables multicast/broadest services on a synchronized single frequency network, that is, MBSFN,
as it treats signals from different base stations is propagating through a multipath channel and can efficiently
combine them.
The multiple access in the downlink is based on OFDMA. In each TTI (Transmission Time Interval), a
scheduling decision is made where each scheduled UE is signed a certain amount of radio resources in the time
and frequency domain. The radio resources allocated to different UEs are orthogonal to each other, which
mean there is no intra-cell interference.
Further, we describe the frame structure and the radio resource block structure in the downlink, as well as
the basic principles of resource allocation and the supported MIMO modes.
Before going into details about the resource block structure for the downlink, we first describe the frame
structure in the time domain, which is a common element shared by both downlink and uplink.
In LTE specifications, the size of elements in the time domain is expressed as a number of time units T =
1/(15000 x 2048) seconds. As the normal subcarrier spacing is defined to be f = 15kHz, T, can be regarded as
the sampling time of an FFT-based OFDM transmitter/receiver implementation with FFT size N = 2048. Note
that this is just for notation purpose, as different FFT sizes are supported depending on the transmission
bandwidth. LTE supports both TDD and FDD.
Figure 5.25: Frame structure type 1 . For the normal CP, =160. 𝑠for the first OFDM symbols. and
=144. 𝑠 for the remaining OFDM symbols, which together fill the entire slot of 0.5ms. For extended
CP, =512. 𝑠
The DwPTS field: This is the downlink part of the special subframe, and can be regarded is as on ordinary but
shorter downlink sub frame for downlink data transmission. Its length can be varied from three up to twelve
OFDM symbols.
The UpPTS field: This is the uplink part of the special subframe, and has a short duration with one or two
OFDM symbols. It can be used for transmission of uplink sounding reference signals and random access
preambles.
The GP field: The remaining symbols in the special sub frame that have not been allocated to DwPTS or
UpPTS are allocated to the GP field, which is used to provide the guard period for the downlink-to-uplink and
the uplink-to-downlink switch.
supported, and transmission is based on the shared channel structure where the radio resource is shared
among different UEs.
With OFDMA, the downlink resource allocation is characterized by the fact that each scheduled UE
occupies a number of resource blocks while each resource block is assigned exclusively to one UE at any
time. Physical resource blocks (PRBs) and virtual resource blocks (VRBs) are defined to support
different kinds of resource allocation types.
The VRB is introduced to support both block-wise transmission (localized) and transmission on non-
consecutive subcarriers (distributed) as a means to maximize frequency diversity. The LTE downlink
supports three resource allocation types: type 0, 1, and 2. The downlink scheduling is performed at the
eNode-B based on the channel quality information fed back from UEs, and then the downlink resource
assignment information is sent to UEs on the PDCCH channel.
A PRB is defined as consecutive OFDM symbols in the time domain and Consecutive
subcarriers in the frequency domain, as shown in figure 5.27. Therefore, each PRB corresponds to one
slot in the time domain (0.5 ms) and 180 kHz in the frequency domain. PRBs are numbered from 0 to
in the frequency domain. The PRB number of a resource element (k, l) in a slot is given
by
𝑘
The PRB is to support resource allocations of type 0 and type 1, which are defined for the DCI format 1,
2, and 2A.
In type 0 resource allocations, several consecutive PRBs constitute a resource block group (RBG), and
the resource allocation is done in units of RBGs. Therefore, a bitmap indicating the RBG is sufficient to
carry the resource assignment. The allocated RBGs to a certain UE do not need to be adjacent to each
other, which provide frequency diversity. The RBG size P, that is, the number of PRBs in each RBG,
depends on the bandwidth and is specified in Table 5.6. An example of type 0 resource allocation is
shown in Figure 5.28, where P = 4 and RBGs 0, 3, 4,.. are allocated to a particular UE.
In type 1 resource allocations, all the RBGs are grouped into a number of RBG subsets, and certain
PRBs inside a selected RBG subset are allocated to the UE.
There are a total of P RBG subsets, where P is the RBG size. An RBG subset p, where 0≤ p < P, consists
of every P-th RBG starting from RBG p.
Fig. 5.28 Examples of resource allocation type 0 and type 1, where the RBG size P=4
This type of resource allocation is more flexible and is able to provide higher frequency diversity, but it
also requires a larger overhead.
An example of type resource allocation is shown in Figure 5.28, where P = 4 and the RBG subset 0
selected for the given UE.
In type 2 resource allocations that are defined for the DCI format 1A, 1B, 1C and 1D, PRBs are not
directly allocated. Instead, VRBs are allocated, which are then mapped onto PRBs. A VRB is of the same
size as a PRB. There are two types VRBs ; VRBs of the localized type and VRBs of the distributed type.
Similar to the downlink, shared-channel transmission and channel-dependent scheduling are supported
in the uplink. Resource allocation in the uplink is also performed at the eNode-B.
Based on the channel quality measured on the uplink sounding reference signals and the scheduling
requests sent from UES, the eNode-B assigns a unique time frequency resource to a scheduled UE,
which achieves orthogonal intra-cell transmission.
Such intra-cell orthogonality in the uplink is preserved between UEs by using timing advance such
that the transport blocks of different UEs are received synchronously at the eNode-B.
This provides significant coverage and capacity gain in the uplink over UMTS, which employ's non-
orthogonal transmission in the uplink and the performance is limited by inter-channel interference.
In general, SC- FDMA is able to support both localized and distributed resource allocation.
In the current specification, only localized resource allocation is supported in the uplink, which
preserves the single-carrier property and can better exploit the multiuser diversity gain in the
frequency domain.
The resource assignment information for the uplink transmission is carried on the PDCCH with DCI
format 0, indicating a set of contiguously allocated resource blocks.
However, not all integer multiples of one resource block are allowed to be assigned to a UE, which is to
simplify the DFT design for the SC-FDMA transceiver.
Only factors 2, 3, and 5 are allowed. The frequency hopping is supported to provide frequency diversity,
with which the UEs can hop between frequencies within or between the allocated subframes.
For the MIMO modes supported in the uplink, the terminal complexity and cost are among the major
concerns.
MU-MIMO is supported, which allocates the same time and frequency resource to two UEs with each
transmitting on a single antenna. This is also called Spatial Division Multiple Access (SDMA).
The advantage is that only one transmit antenna per UE is required. To separate streams for different
UEs, channel state information is required at the eNode-B, which is obtained through uplink reference
signals that are orthogonal between UEs.
Uplink MU-MIMO also requires power control, as the near-far problem arises when multiple UEs are
multiplexed on the same radio resource.
For UEs with two or more transmit antennas, closed loop adaptive antenna selection transmit diversity
shall be supported.
Here UE only needs one transmit chain and amplifier. The antenna selection is based on feedback from
eNode-B.
TEXT BOOK
“Fundamentals of LTE” Arunabha Ghosh, Jan Zhang, Jefferey Andrews, Riaz Mohammed,
Pearson education (Formerly Prentice Hall, Communications Engg and Emerging Technologies),
ISBN-13: 978-0-13-703311-9.