A group is a set of elements and some operation that satisfy some requirements. This operation is usually called "addition" or "multiplication", depending on the group, even though it may not be actually the classic addition or multiplication. The integers $0 < x < p$ for some prime $p$ form a group under the modular multiplication operation (multiply the integers, then compute the remainder of the division by $p$). This group can be denoted by $\mathbb{Z}_p^*$.
A field is a set of elements with two operations that satisfy some requirements; you can think about it as consisting of two groups (one for each operation). The integers $0 <= x < p$ for some prime $p$ form a field under modular addition and multiplication. This field can be denoted by $\mathbb{F}_p$.
That is the field that is used by FFC DH. However, note that DH only requires a group, and not a field. FFC DH uses the multiplicative group of the finite field, i.e. $\mathbb{Z}_p^*$; the addition operation is never used.
An elliptic curve is a set of $(x, y)$ coordinates ("points") that satisfy some equation. In cryptography, these coordinates are elements of a finite field, e.g. $\mathbb{F}_p$. The curve also forms a group under the "point addition" operation, which takes two pair of points and return a third point also on the curve. Note that a curve forms a group, and uses an underlying field, but it's not a field itself.
(A curve has a "point multiplication" operation, but that's not a group operation between points, it's simply repeated addition, like exponentiation in $\mathbb{F}_p$ is just repeated multiplication).