How to converts Pseudo boolean constraints to cnf format?

How to convert Pseudo boolean constraints to CNF format

for example L1 + … + Ln ≥ 1 is converted to L1 ∨ … ∨ Ln

L1 + … + Ln ≥ k

L1 + … + Ln < k

or

L1 + L2 = k

or

2 L1 + 2 L2L3 + L4 ≥ 3

is it there a book that I could read to understand more?

For the special case of $$L_1 + \dots + L_n \ge k$$ (or $$\le k$$), see Encoding 1-out-of-n constraint for SAT solvers and Reduce the following problem to SAT.