new combinatorial proof of the multiple binomial coefficient identity

Introduction/purpose: in this paper a new combinatorial proof of an already existing multiple sum with multiple binomial coefficients is given. the derived identity is related to the fibonacci numbers. methods: combinatorial reasoning is used to obtain the results. results: the already known identity was obtained by using a new combinatorial reasoning. conclusions: the new combinatorial reasoning led to the solution of the already existing identity.