enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Free-space path loss - Wikipedia

    en.wikipedia.org/wiki/Free-space_path_loss

    The free-space path loss (FSPL) formula derives from the Friis transmission formula. [3] This states that in a radio system consisting of a transmitting antenna transmitting radio waves to a receiving antenna, the ratio of radio wave power received P r {\displaystyle P_{r}} to the power transmitted P t {\displaystyle P_{t}} is:

  3. Two-ray ground-reflection model - Wikipedia

    en.wikipedia.org/wiki/Two-ray_ground-reflection...

    From the figure the received line of sight component may be written as = {() /}and the ground reflected component may be written as = {() (+ ′) / + ′}where () is the transmitted signal, is the length of the direct line-of-sight (LOS) ray, + ′ is the length of the ground-reflected ray, is the combined antenna gain along the LOS path, is the combined antenna gain along the ground-reflected ...

  4. Log-distance path loss model - Wikipedia

    en.wikipedia.org/wiki/Log-distance_path_loss_model

    The log-distance path loss model is a radio propagation model that predicts the path loss a signal encounters inside a building or densely populated areas over long distance. While the log-distance model is suitable for longer distances, the short-distance path loss model is often used for indoor environments or very short outdoor distances.

  5. Path loss - Wikipedia

    en.wikipedia.org/wiki/Path_loss

    Among the most commonly used methods in the design of radio equipment such as antennas and feeds is the finite-difference time-domain method. The path loss in other frequency bands (medium wave (MW), shortwave (SW or HF), microwave (SHF)) is predicted with similar methods, though the concrete algorithms and formulas may be very different from ...

  6. Path (graph theory) - Wikipedia

    en.wikipedia.org/wiki/Path_(graph_theory)

    A directed walk is a finite or infinite sequence of edges directed in the same direction which joins a sequence of vertices. [2]Let G = (V, E, ϕ) be a directed graph. A finite directed walk is a sequence of edges (e 1, e 2, …, e n − 1) for which there is a sequence of vertices (v 1, v 2, …, v n) such that ϕ(e i) = (v i, v i + 1) for i = 1, 2, …, n − 1.

  7. Distance (graph theory) - Wikipedia

    en.wikipedia.org/wiki/Distance_(graph_theory)

    The weighted shortest-path distance generalises the geodesic distance to weighted graphs. In this case it is assumed that the weight of an edge represents its length or, for complex networks the cost of the interaction, and the weighted shortest-path distance d W ( u , v ) is the minimum sum of weights across all the paths connecting u and v .

  8. Fréchet distance - Wikipedia

    en.wikipedia.org/wiki/Fréchet_distance

    Free-space diagram of the red and the blue curve. In contrast to the definition in the text, which uses the parameter interval [0,1] for both curves, the curves are parameterized by arc length in this example. An important tool for calculating the Fréchet distance of two curves is the free-space diagram, which was introduced by Alt and Godau. [4]

  9. Bragg's law - Wikipedia

    en.wikipedia.org/wiki/Bragg's_law

    This path difference is (+) (′). The two separate waves will arrive at a point (infinitely far from these lattice planes) with the same phase , and hence undergo constructive interference , if and only if this path difference is equal to any integer value of the wavelength , i.e. n λ = ( A B + B C ) − ( A C ′ ) {\displaystyle n\lambda ...