Let denote a cycle of length and let denote a star with edges. For graphs , , and , a -multidecomposition of is a partition of the edge set of into copies of and copies of with at least one copy of and at least one copy of . In this paper, necessary and sufficient conditions for the existence of the -multidecomposition of a complete bipartite graph are given.