solution to the overflow problem

so what is the solution to the overflow problem.can anybody give the solution for this problem.which adder can solve the problem.i have used '+' sign for addition and '*' for multiplication in vhdl program.

Instead of repeating unclear questions about "overflow" you should better explain your application.

From some hints in previous posts, I assume you have something like a FIR filter

y = Σa*x

As already mentioned by others, no overflow will occur in an integer multiplication. When summing indidual product terms, you can avoid an overflow by assigning sufficient width to the accumulator. Depending on your application, you possibly want to resize the result by skipping most significant bits. In this case, you need to apply saturation logic, limit the value to the highest or lowest number that can be represented by the resized value.

A comfortable way to perform number scaling, saturation and more is to refer to the VHDL fixed point packages. My suggestion is however to solve to implement the signal processing chain at least once with generic VHDL.

FvM, your reply certainly encapsulates more patience than mine would have. The reply I had in mind was "problem undefined therefore solution undefined". Or alternatively "no stated problem, no solution required, problem solved".

@kannan2590:
If you require help with something, please go to the effort of making a clear description of what the problem actually is. Our forum supply of mind readers is running a bit low at the moment...

Lol flibble and FvM. My answer would be:

to fix overflow - add more bits (or take the rounding error).