Although Radix-10 based arithmetic has been gaining renewed importance over the last few years, decimal systems are not efficient enough and techniques are still under development. In this paper, a modification of the CORDIC method for decimal arithmetic is proposed and applied to produce fast rotations. The algorithm uses BCD operands as inputs, combining the advantages both decimal and binary systems. The result is an important number of iterations reduction compared with the original decimal CORDIC method. Finally, a FPGA-based radix-10 architecture that can be used to produce rotations with more precision and speed is presented and different experiments showing the advantages of the new method are shown.