doc: Fix errors found by codespell and aspell

This commit is contained in:
Tom Henderson
2023-03-09 07:25:08 -08:00
parent 9a2fd5d597
commit df20f5f5e8
12 changed files with 15 additions and 15 deletions

View File

@@ -818,7 +818,7 @@ simclick_sim_command(simclick_node_t* simnode, int cmd, ...)
// Try to fill the buffer with up to size bytes.
// If this is not enough space, write the required buffer size into
// the size variable and return an error code.
// Otherwise return the bytes actually writte into the buffer in size.
// Otherwise return the bytes actually written into the buffer in size.
// Append key/value pair, separated by \0.
std::map<std::string, std::string> defines = clickInstance->GetDefines();

View File

@@ -296,7 +296,7 @@ class int64x64_t
/**
* Compute the inverse of an integer value.
*
* Ordinary division by an integer would be limited to 64 bits of precsion.
* Ordinary division by an integer would be limited to 64 bits of precision.
* Instead, we multiply by the 128-bit inverse of the divisor.
* This function computes the inverse to 128-bit precision.
* MulByInvert() then completes the division.

View File

@@ -28,7 +28,7 @@
// | fd-net-device |--------------| fd-net-device |
// +----------------+ +----------------+
//
// This example is aimed at meassuring the thoughput of the FdNetDevice
// This example is aimed at measuring the thoughput of the FdNetDevice
// in a pure simulation. For this purpose two FdNetDevices, attached to
// different nodes but in a same simulation, are connected using a socket pair.
// TCP traffic is sent at a saturating data rate. Then the thoughput can

View File

@@ -1137,7 +1137,7 @@ GlobalRouteManagerImpl::SPFNexthopCalculation(SPFVertex* v,
// Above, when we were considering the root node, we calculated the next hop
// address and outgoing interface required to get off of the root network.
// At this point, we are further away from the root network along one of the
// (shortest) paths. So the next hop and outoing interface remain the same
// (shortest) paths. So the next hop and outgoing interface remain the same
// (are inherited).
//
w->InheritAllRootExitDirections(v);

View File

@@ -1037,7 +1037,7 @@ In detail, the index :math:`\widehat{i}_{k}(t)` to which RBG :math:`k` is assign
\widehat{i}_{k}(t) = \underset{j=1,...,N}{\operatorname{argmax}}
\left( \frac{ R_{j}(k,t) }{ T_\mathrm{j}(t) } \right)
where :math:`T_{j}(t)` is the past througput performance perceived by the
where :math:`T_{j}(t)` is the past throughput performance perceived by the
user :math:`j`.
According to the above scheduling algorithm, a user can be allocated to
different RBGs, which can be either adjacent or not, depending on the current
@@ -4252,7 +4252,7 @@ Distributed Fractional Frequency Reuse
This Distributed Fractional Frequency Reuse Algorithm was presented in [DKimura2012]_. It
automatically optimizes cell-edge sub-bands by focusing on user distribution (in particular,
receive-power distribution). This algorithm adaptively selects RBs for cell-edge sub-band on
basis of coordination information from adjecent cells and notifies the base stations of the
basis of coordination information from adjacent cells and notifies the base stations of the
adjacent cells, which RBs it selected to use in edge sub-band. The base station of each cell
uses the received information and the following equation to compute cell-edge-band metric
:math:`A_{k}` for each RB.

View File

@@ -1945,7 +1945,7 @@ EPC scenarios.
With Distributed Fractional Frequency Reuse Algorithm, eNb uses entire cell bandwidth and there can
be two sub-bands: center sub-band and edge sub-band . Within these sub-bands UEs can be served with
different power level. Algorithm adaptively selects RBs for cell-edge sub-band on basis of
coordination information (i.e. RNTP) from adjecent cells and notifies the base stations of the adjacent cells,
coordination information (i.e. RNTP) from adjacent cells and notifies the base stations of the adjacent cells,
which RBs it selected to use in edge sub-band. If there are no UE classified as edge UE in cell,
eNB will not use any RBs as edge sub-band.

View File

@@ -31,7 +31,7 @@ using namespace ns3;
NS_LOG_COMPONENT_DEFINE("LenaX2HandoverExample");
/**
* UE Connection established noticication.
* UE Connection established notification.
*
* \param context The context.
* \param imsi The IMSI of the connected terminal.
@@ -82,7 +82,7 @@ NotifyHandoverEndOkUe(std::string context, uint64_t imsi, uint16_t cellid, uint1
}
/**
* eNB Connection established noticication.
* eNB Connection established notification.
*
* \param context The context.
* \param imsi The IMSI of the connected terminal.

View File

@@ -270,7 +270,7 @@ LteRlcAmE2eTestCase::DoRun()
// retransmitted is much lower. This effect can be best noteed
// at very high loss rates, and can be adjusted by timers and
// params.
// 2) throuhgput is not meaningful, you need to evaluate the time
// 2) throughput is not meaningful, you need to evaluate the time
// it takes for all PDUs to be (re)transmitted successfully,
// i.e., how long it takes for the TX and reTX queues to deplete.

View File

@@ -177,7 +177,7 @@ of the available implementations:
interference model (implemented in ``SpectrumInterference``)
together with an error model based on Shannon capacity (described
in [Baldo2009Spectrum]_ and implemented in ``SpectrumErrorModel``. This PHY
uses the ``GenericPhy`` interface. Its addditional custom signal
uses the ``GenericPhy`` interface. Its additional custom signal
parameters are defined in ``HalfDuplexIdealPhySignalParameters``.
* ``WifiSpectrumValueHelper`` is an helper object that makes it easy

View File

@@ -44,7 +44,7 @@ class SpectrumConverter : public SimpleRefCount<SpectrumConverter>
/**
* Create a SpectrumConverter class that will be able to convert ValueVsFreq
* instances defined over one SpectrumModel to corresponding ValueVsFreq
* instances defined over a diffent SpectrumModel
* instances defined over a different SpectrumModel
*
* @param fromSpectrumModel the SpectrumModel to convert from
* @param toSpectrumModel the SpectrumModel to convert to

View File

@@ -1046,7 +1046,7 @@ ThreeGppChannelModel::GetThreeGppTable(Ptr<const ChannelCondition> channelCondit
}
else
{
NS_FATAL_ERROR("unkonw scenarios");
NS_FATAL_ERROR("unknown scenarios");
}
return table3gpp;