This paper presents a new scheme for BCD multiplication. This new scheme features a completely carry-free multiplication. The parallel structure of the new algorithm is investigated. This fast architecture was derived by looking at multiplication in a fresh perspective. A carry is able to be computed without performing multiplication on any of the previous bits. The new approach is expected to have a lot of potential contributions to digital design.