Weighted Partial MaxSAT(WPMS) is a generalization of Satisfiability problem. Many optimization problems can be reduced to WPMS in polynomial time. So it is important to develop MaxSAT solvers. Cardinality constraints plays important role in solving MaxSAT. In this paper, we propose Weighted Totalizer(WTO) and Partial Encording(PE). WTO is based on Totalizer(TO), and use less variables and clauses than TO. PE is a new encording method, which is optimized for particular WPMS problems. Our experimental results show the effectiveness of these methods.