fast fourier transform ifft as an embodiment and performs an inverse fourier transform operation using the integers generated by the integer coding unit 320 0026 fig4 is a flowchart illustrating an embodiment of the integer coding method according to the present invention first samples in units of frames input in the form of a vlc are inversely quantized thereby generating samples having real number values 410 subsequently if the value of the input samples in units of the frames is 2 m to 2 n m lt n maximum sample values of each frame recorded in a header for each frame are investigated 420 here the input maximum sample values have a close relation to the size of frames that is if the size of the frame is 2048 samples and a maximum sample value is m when the size of the frame is 1024 samples the maximum sample value is m 2 and when the size of the frame is 512 samples the maximum sample value is m 4 and when the size of the frame is 256 samples the maximum sample value is m 8 for example if u201c a frame having the number of samples equal to 512 u201d u201c a frame having the number of samples equal to 1024 u201d u201c a frame having the number of samples equal to 256 u201d u201c a frame having the number of samples equal to 1024 u201d u201c frame having the number of samples equal to 256 u201d and u201c a frame having the number of samples.